ACM Home Page

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

Found 200,399 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 200,399 of 1,394,228

Results 1 - 20 of 200,399
Sort by in
Result page: 1   2   3   4   5   6   7   8   9   10    next    >>
1
Heuristics for the 0–1 min-knapsack problem
September 1991
Acta Cybernetica , Volume 10 Issue 1-2
Publisher: Acta Cybernetica
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: 3
2
Multivariate Bernstein and Markov inequalities
September 1992
Journal of Approximation Theory , Volume 70 Issue 3
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: 2
3
Computer-assisted existence proofs for two-point boundary value problems
February 1991
Computing , Volume 46 Issue 1
Publisher: Springer-Verlag New York, Inc.
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
4
Mutation Analysis for Reactive System Environment Properties
November 2006
MUTATION '06: Proceedings of the Second Workshop on Mutation Analysis
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

Reactive systems used in safety-critical domains demand high level of confidence. The development of these systems, which are submitted to several normative recommendations, is complex and expensive. Reactive systems can be developed by using the data-flow ...

5
A characterization for a set of partial partitions to define an X-tree
March 2002
Discrete Mathematics , Volume 247 Issue 1-3
Publisher: Elsevier Science Publishers B. V.
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: 1

Trees whose vertices are partially labelled by elements of a finite set X provide a natural way to represent partitions of subsets of X. The condition under which a given collection of such partial partitions of X can be represented ...


Keywords: X-trees, chordal graphs, free X-trees, partition intersection graphs
6
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.
7
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
8
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
9
Bound pairs of fronts in a real Ginzburg-Landau equation coupled to a mean field
July 1995
Physica D , Volume 85 Issue 1-2
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
10
Simulation of the switching curve in antiferromagnetic ising model
September 2003
ICCMSE '03: Proceedings of the international conference on Computational methods in sciences and engineering
Publisher: World Scientific Publishing Co., Inc.
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

At sufficiently low temperatures T we expect all spins in the antiferromagnetic ground state for a finite net size. Then we apply magnetic field +H on spins "down" sublattice and -H on spins "up" sublattice to provoke spin reversals ...

11
Bipartite Subgraphs and Quasi-Randomness
June 2004
Graphs and Combinatorics , Volume 20 Issue 2
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

We say that a family of graphs * is p-quasi-random, 0<p<1, if it shares typical properties of the random graph G(n,p); for a definition, see below. We denote by * the class of all graphs H for which * and ...

12
Process Simulation Using Randomized Markov Chain and Truncated Marginal Distribution
May 2002
The Journal of Supercomputing , Volume 22 Issue 1
Publisher: Kluwer Academic Publishers
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: 1

Generating pseudo random objects is one of the key issues in computer simulation of complex systems. Most earlier simulation systems include procedures for the generation of independent and identically distributed random variables or some classical random ...


Keywords: Newton optimization, autocorrelation, random process, randomized Markov chain, simulation
13
Genetic algorithms based fuzzy controller for high order systems
November 1997
Fuzzy Sets and Systems , Volume 91 Issue 3
Publisher: Elsevier North-Holland, 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

Keywords: fuzzy logic control, genetic algorithms, high order systems
14
On the positive radial solution of P-Laplacian equation with singular coefficients
May 1998
Nonlinear Analysis: Theory, Methods & Applications , Volume 32 Issue 5
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

Keywords: P-Laplacian equation, Pohozaev identity, mountain pass theorem, singular coefficient
15
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
16
Recursive monadic bindings
September 2000
ICFP '00: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (689.66 KB)
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 3,   Downloads (12 Months): 40,   Downloads (Overall): 197,    Citation Count: 9

Monads have become a popular tool for dealing with computational effects in Haskell for two significant reasons: equational reasoning is retained even in the presence of effects; and program modularity is enhanced by hiding "plumbing" issues inside the ...


Also published in:
September 2000 SIGPLAN Notices Volume 35 Issue 9
17
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
18
Extension of the BRYNTRN Code to Monoenergetic Light Ion Beams
November 2003
Extension of the BRYNTRN Code to Monoenergetic Light Ion Beams
Publisher: NASA Langley Technical Report Server
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

A monoenergetic version of the BRYNTRN transport code is extended to beam transport of light ions (super2H, super3H, super3He, and super4He) in shielding materials (thick targets). The redistribution of energy in nuclear reactions is included in transport ...

19
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
20
A New Image Fusion Algorithm Based on Wavelet Transform
September 2003
ICCIMA '03: Proceedings of the 5th International Conference on Computational Intelligence and Multimedia Applications
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

A new method is presented based on wavelet transform (WT) for the fusion of a high-resolution panchromatic image and a low-resolution multi-spectral image. The high-resolution panchromatic image approximation can be first merged into the multi-spectral ...

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