674 search results - page 130 / 135 » The computational complexity of the parallel knock-out probl... |
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
ICDCN
2009
Springer
14 years 2 months ago
2009
Springer
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
NEUROSCIENCE
2001
Springer
13 years 11 months ago
2001
Springer
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
ISPASS
2006
IEEE
14 years 1 months ago
2006
IEEE
Applications in Computer Networks often require high throughput access to large data structures for lookup and classification. Many advanced algorithms exist to speed these searc...
IEEEPACT
2005
IEEE
14 years 29 days ago
2005
IEEE
VLIW architectures are popular in embedded systems because they offer high-performance processing at low cost and energy. The major problem with traditional VLIW designs is that t...