ACM Home Page

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

Found 11,841 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 11,841 of 1,394,228

Results 1 - 20 of 11,841
Sort by in
Result page: 1   2   3   4   5   6   7   8   9   10    next    >>
1
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
2
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
3
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
4
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 ...

5
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
6
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
7
Localization of age-dependent anti-crowding populations
March 1995
Quarterly of Applied Mathematics , Volume LIII Issue 1
Publisher: American Mathematical Society
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Keywords: age-dependence, diffusion, populations
8
Summary remarks
November 1999
Complexity
Publisher: Perseus Books
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
9
Characterizing linear size circuits in terms of privacy
February 1999
Journal of Computer and System Sciences , Volume 58 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: 2
10
Abstract computability and algebraic specification
April 2002
Transactions on Computational Logic (TOCL) , Volume 3 Issue 2
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (494.44 KB)
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 17,   Downloads (12 Months): 97,   Downloads (Overall): 1942,    Citation Count: 2

Abstract computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable ...


Keywords: Abstract computability, algebraic specification, computable analysis, conditional equations, equational logic, metric algebras, topological algebras
11
A lower bound for radio broadcast
October 1991
Journal of Computer and System Sciences , Volume 43 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: 63
12
Effective subdirect decomposition: a case study
June 1992
Theoretical Computer Science , Volume 100 Issue 1
Publisher: Elsevier Science Publishers 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
13
Reducing the complexity of reductions
February 2002
Computational Complexity , Volume 10 Issue 2
Publisher: Birkhauser Verlag
Additional Information:full citation, cited by, index terms, review
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 2

Keywords: Berman-Hartmanis conjecture, completeness, constant-depth circuits, isomorphisms, powering in finite fields
14
On the time complexity of 2-tag systems and small universal Turing machines
October 2006
FOCS '06: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
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: 4

We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing machines in polynomial time. This is an exponential improvement on the previously ...

15
Neural Coding in the Dorsal Visual Stream
July 2008
SAB '08: Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats
Publisher: Springer-Verlag
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

The information flow along the dorsal visual stream of the primate brain is being thoroughly studied in neuroscience, and this research is being used in artificial intelligence applications. The knowledge regarding one of its most critical stages though, ...

16
Dynamic load balancing strategies for conservative parallel simulations
July 1997
PADS '97: Proceedings of the eleventh workshop on Parallel and distributed simulation
Publisher: ACM
Full text available: PdfPdf (1.09 MB)
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 9,   Downloads (12 Months): 50,   Downloads (Overall): 430,    Citation Count: 12

This paper studies the problem of load balancing for conservative parallel simulations for execution on a multicomputer. The synchronization protocol makes use of Chandy-Misra null-messages. We propose a dynamic load balancing algorithm which assumes ...


Also published in:
July 1997 SIGSIM Simulation Digest Volume 27 Issue 1
17
The design and evaluation of parallel algorithms (abstract)
March 1994
CSC '94: Proceedings of the 22nd annual ACM computer science conference on Scaling up : meeting the challenge of complexity in real-world computing applications: meeting the challenge of complexity in real-world computing applications
Publisher: ACM Request Permissions Request Permissions   
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
18
A class of two-dimensional cellular automata and their applications in random pattern testing
February 1994
Journal of Electronic Testing: Theory and Applications , Volume 5 Issue 1
Publisher: Kluwer Academic Publishers
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

Keywords: 2-D CA, built-in self test, cellular automata (CA), pseudorandom patterns
19
Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies
January 1982
Journal of the ACM (JACM) , Volume 29 Issue 1
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (803.23 KB)
Additional Information:full citation, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 2,   Downloads (12 Months): 33,   Downloads (Overall): 215,    Citation Count: 14
20
Parallel unsteady turbo-pump simulations for liquid rocket engines
November 2000
Supercomputing '00: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM)
Publisher: IEEE Computer Society
Full text available: PdfPdf (1.45 MB)
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 9,   Downloads (12 Months): 38,   Downloads (Overall): 295,    Citation Count: 2

This paper reports the progress being made towards complete turbo-pump simulation capability for liquid rocket engines. The Space Shuttle Main Engine (SSME) turbo-pump impeller is used as a test case for the performance evaluation of the MPI, hybrid ...

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