316 search results - page 23 / 64 » On the Space Complexity of Randomized Synchronization |
ISSTA
1998
ACM
15 years 1 months ago
1998
ACM
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
EMO
2005
Springer
15 years 3 months ago
2005
Springer
Nearly all Multi-Objective Evolutionary Algorithms (MOEA) rely on random generation of initial population. In large and complex search spaces, this random method often leads to an ...
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
— This paper presents a multi-skill motion planner which is able to sequentially synchronize parameterized motion skills in order to achieve humanoid motions exhibiting complex w...
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...