ACM Home Page

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

Found 140,785 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 140,785 of 1,394,228

Results 1 - 20 of 140,785
Sort by in
Result page: 1   2   3   4   5   6   7   8   9   10    next    >>
1
The step-2 nilpotent (n,n(n+1)/2) sub-Riemannian geometry
April 2006
Journal of Dynamical and Control Systems , Volume 12 Issue 2
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

We study the sub-Riemannian structure determined by a left-invariant distribution of rank n on a step-2 simply-connected nilpotent Lie group G of dimension n(n+1)/2. We describe a transitive group action that leaves invariant ...


Keywords: exponential mapping, extremal curves, nilpotent Lie algebras, sub-Riemannian geodesics
2
A Mathematical Model and Scheduling Heuristics for Satisfying Prioritized Data Requests in an Oversubscribed Communication Network
September 2000
IEEE Transactions on Parallel and Distributed Systems , Volume 11 Issue 9
Publisher: IEEE Press
Full text available: Publisher SitePublisher Site
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: 7

Abstract¿Providing up-to-date input to users' applications is an important data management problem for a distributed computing environment, where each data storage location and intermediate node may have specific data available, storage limitations, ...


Keywords: Communication network, data management, Dijkstra's multiple-source shortest-path algorithm, distributed processing, heterogeneous computing, scheduling heuristics.
3
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
4
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
5
Verifying infinite state processes with sequential and parallel composition
January 1995
POPL '95: Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (1.29 MB)
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 2,   Downloads (12 Months): 20,   Downloads (Overall): 209,    Citation Count: 1

We investigate the verification problem of infinite-state process w.r.t. logic-based specifications that express properties which may be nonregular. We consider the process algebra PA which integrates and strictly subsumes the algebras BPA (basic process ...

6
A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time
July 1998
Theoretical Computer Science , Volume 202 Issue 1-2
Publisher: Elsevier Science Publishers Ltd.
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: 31

Keywords: Markov chain, bisimulation equivalence, priority, probability, process algebra
7
Defining and detecting feature interactions
January 1997
Proceedings of the IFIP TC 2 WG 2.1 international workshop on Algorithmic languages and calculi
Publisher: Chapman & Hall, 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: 1

Keywords: feature interactions, logic programming, relational specifications
8
Performance simulations of moving target search algorithms
January 2009
International Journal of Computer Games Technology , Volume 2009
Publisher: Hindawi Publishing Corp.
Full text available: PdfPdf (888.58 KB)
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): 2,   Downloads (12 Months): 14,   Downloads (Overall): 14,    Citation Count: 0

The design of appropriate moving target search (MTS) algorithms for computer-generated bots poses serious challenges as they have to satisfy stringent requirements that include computation and execution efficiency. In this paper, we investigate the performance ...

9
Generalizing the notion of schema in genetic algorithms
August 1991
Artificial Intelligence , Volume 50 Issue 3
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: 7
10
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
11
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
12
Magnetic dynamics around a configuration of two square antihelmholtz coils
October 2008
MAMECTIS'08: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems
Publisher: World Scientific and Engineering Academy and Society (WSEAS)
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 magnetic dynamics around two square AntiHelmholtz coils and special configuration of electrical circuits is used in order to create the simplest magnetic traps. Section 1 gives the Biot-Savart-Laplace magnetic field H around two square AntiHelmholtz ...


Keywords: magnetic field, magnetic geometric dynamics, quadratic Lagrangian
13
Fast estimation of diameter and shortest paths (without matrix multiplication)
January 1996
SODA '96: Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Full text available: PdfPdf (809.74 KB)
Additional Information:full citation, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 2,   Downloads (12 Months): 37,   Downloads (Overall): 230,    Citation Count: 10
14
On the evaluation of reachable workspace for redundant manipulators
June 1990
IEA/AIE '90: Proceedings of the 3rd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2 , Volume 2
Publisher: ACM
Full text available: PdfPdf (475.69 KB)
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 3,   Downloads (12 Months): 22,   Downloads (Overall): 221,    Citation Count: 1

In this paper, we discuss the problem of computing the reachable workspace for redundant manipulators. Algorithms that compute workspace boundary points by using screw theory are presented. These algorithms cannot distinguish holes and voids that are ...

15
A Scalable Hybrid Regular Expression Pattern Matcher
April 2006
FCCM '06: Proceedings of the 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'06) - Volume 00 , Volume 00
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: 1

As new Internet technologies emerge, the ability to do full regular expression pattern matching on network packets to support these new technologies is becoming increasingly important. Current technologies that can benefit from high-speed pattern matching ...

16
The semantics of types in programming languages
January 1995
Handbook of logic in computer science (vol. 3)
Publisher: Oxford University Press
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
17
Dna binding economies
January 2007
Dna binding economies
Publisher: Massachusetts Institute of Technology
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

This thesis develops a new scalable modeling framework at the interface of game theory and machine learning to recover economic structures from limited slices of data. Inference using economic models has broad applicability in machine learning. Economic ...

18
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
19
A path-relinking approach for a bi-criteria disassembly sequencing problem
December 2008
Computers and Operations Research , Volume 35 Issue 12
Publisher: Elsevier Science Ltd.
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 first crucial step of product recovery is disassembly. Some product disassembly is almost always needed in remanufacturing, recycling, and disposal. Since disassembly tends to be expensive, disassembly sequence planning becomes important in minimizing ...


Keywords: Disassembly sequence problem, GRASP, Multicriteria, Path relinking, Reverse logistics
20
Connection calculus theorem proving with multiple built-in theories
February 2000
Journal of Symbolic Computation , Volume 29 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: 0
Result page: 1   2   3   4   5   6   7   8   9   10    next    >>