ACM Home Page

Searching within The Guide for: CCS:F1  (start a new search)

Found 38,416 of 1,394,228

REFINE YOUR SEARCH

ADVANCED SEARCH
Advanced search.  Advanced Search

FEEDBACK
Please provide us with feedback. Please provide us with feedback

Found 38,416 of 1,394,228

Results 1 - 20 of 38,416
Sort by in
Result page: 1   2   3   4   5   6   7   8   9   10    next    >>
1
An efficient network synchronization protocol
December 1984
STOC '84: Proceedings of the sixteenth annual ACM symposium on Theory of computing
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (396.72 KB)
Additional Information:full citation, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 1,   Downloads (12 Months): 16,   Downloads (Overall): 152,    Citation Count: 4
2
On global asymptotic stability of recurrent neural networks with time-varying delays
September 2003
Applied Mathematics and Computation , Volume 142 Issue 1
Publisher: Elsevier Science Inc.
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 5

In this paper, by constructing a new Lyapunov functional, and using M-matrix and topological degree tool, problem of the global asymptotic stability (GAS) is discussed for a class of recurrent neural networks with time-varying delays. Some simple ...


Keywords: Lyapunov functional, global asymptotic stability, nonsingular M-matrix, recurrent neural networks, time-varying delays, topological degree
3
Application of artificial neural networks to optimum bit selection
March 2002
Computers & Geosciences , Volume 28 Issue 2
Publisher: Pergamon Press, Inc.
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Optimum bit selection is one of the important issues in drilling engineering. Usually, optimum bit selection is determined by the lowest cost per foot and is a function of bit cost and performance as well as penetration rate. Conventional optimum rock ...


Keywords: fractals, neural networks, optimization, petroleum engineering, rock bit
4
Undecidability results for low complexity time classes
April 2000
Journal of Computer and System Sciences , Volume 60 Issue 2
Publisher: Academic Press, Inc.
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 1
5
On designing microprogram translator
July 1987
Signal Processing , Volume 13 Issue 1
Publisher: Elsevier North-Holland, Inc.
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
6
Abstract simulators for the DSDE formalism
December 1998
WSC '98: Proceedings of the 30th conference on Winter simulation
Publisher: IEEE Computer Society Press
Full text available: PdfPdf (67.36 KB)
Additional Information:full citation, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 1,   Downloads (12 Months): 13,   Downloads (Overall): 90,    Citation Count: 7
7
A computer microworld to introduce students to probability
July 1994
Journal of Computers in Mathematics and Science Teaching , Volume 13 Issue 2
Publisher: Association for the Advancement of Computing in Education
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
8
Data structures for on-line updating of matroid intersection solutions
December 1984
STOC '84: Proceedings of the sixteenth annual ACM symposium on Theory of computing
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (692.56 KB)
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): 1,   Downloads (12 Months): 7,   Downloads (Overall): 120,    Citation Count: 0

Matroid intersection problems are considered in which one of the matroids is a partition matroid specifying that exactly q elements in the solution must be red, and the rest green. A characterization is presented for how the solution ...

9
Editor's Note
June 2007
IEEE Transactions on Computers , Volume 56 Issue 6
Publisher: IEEE Computer Society
Full text available: Publisher SitePublisher Site
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
10
Incorporating gene functions as priors in model-based clustering of microarray gene expression data
April 2006
Bioinformatics , Volume 22 Issue 7
Publisher: Oxford University Press
Additional Information:full citation, abstract, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 4

Motivation: Cluster analysis of gene expression profiles has been widely applied to clustering genes for gene function discovery. Many approaches have been proposed. The rationale is that the genes with the same biological function or involved ...

11
The parallel sum of nonlinear monotone operators
March 1986
Non-Linear Analysis , Volume 10 Issue 3
Publisher: Elsevier Science Ltd.
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
12
Exact lower time bounds for computing Boolean functions on CREW PRAMs
April 1994
Journal of Computer and System Sciences , Volume 48 Issue 2
Publisher: Academic Press, Inc.
Additional Information:full citation, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 7
13
A Parallel Multi-Path Routing Algorithm for Flexible Transmission in Wireless Sensor Networks
May 2007
AINAW '07: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 , Volume 02
Publisher: IEEE Computer Society
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Multi-path strategy is one of the favorable choices for various applications and environments in sensor networks. In this paper, we study how to choose multi-paths effectively by taking full advantage of the known geographic information. Geographic routing ...

14
Group structured linear cellular automata over Zm
August 1994
Journal of Computer and System Sciences , Volume 49 Issue 1
Publisher: Academic Press, Inc.
Additional Information:full citation, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 1
15
Equivalence in template-guided recombination
September 2008
Natural Computing: an international journal , Volume 7 Issue 3
Publisher: Kluwer Academic Publishers
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Template-guided recombination (TGR) is a formal model for the DNA rearrangement which occurs in certain ciliates. In this paper, the equivalence problem for TGR is considered: given two sets of templates, is their action is the same for all operands? ...


Keywords: Ciliates, DNA recombination, Equivalence, Template-guided recombination
16
Preface
January 2008
Electronic Notes in Theoretical Computer Science (ENTCS) , Volume 194 Issue 3
Publisher: Elsevier Science Publishers B. V.
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
17
Regular symbolic analysis of dynamic networks of pushdown systems
August 2005
CONCUR 2005 - Concurrency Theory
Publisher: Springer-Verlag
Additional Information:full citation, abstract, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 3

We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem of symbolic reachability analysis for these models. More precisely, we consider the problem of computing effective representations ...

18
Circuit size relative to pseudorandom oracles
January 1993
Theoretical Computer Science , Volume 107 Issue 1
Publisher: Elsevier Science Publishers Ltd.
Additional Information:full citation, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 2
19
Formalising TCP's Data Transfer Service Language: A Symbolic Automaton and its Properties
March 2008
Fundamenta Informaticae , Volume 80 Issue 1-3
Publisher: IOS Press
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

The TCP/IP protocol suite defines the procedures governing the movement of data within the Internet. A major component of the suite is the Transmission Control Protocol (TCP), which ensures data flows reliably between Internet applications. We use Coloured ...


Keywords: Coloured Petri Nets, Data Transfer Service, Parametric Systems, Service Language, Symbolic Automata, TCP
20
Forecasting Unstable Policy Enforcement
October 2006
ICSNC '06: Proceedings of the International Conference on Systems and Networks Communication
Publisher: IEEE Computer Society
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Policy-based network management (PBNM) is a promising but not yet delivering discipline aimed at automating network management decisions based on expert knowledge and strategic business objectives. One of the issues scarcely addressed in PBNM is the ...

Result page: 1   2   3   4   5   6   7   8   9   10    next    >>