Sciweavers

1068 search results - page 39 / 214
» For completeness, sublogarithmic space is no space
Sort
View
ENTCS
2007
158views more  ENTCS 2007»
13 years 8 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer
PERCOM
2009
ACM
14 years 3 months ago
Delaunay-Triangulation Based Complete Coverage in Wireless Sensor Networks
—One of the major issues in a wireless sensor network (WSN) is how to cover an interested area. In this paper, we consider the area coverage problem for variable sensing radii WS...
Chinh T. Vu, Yingshu Li
ICPADS
2006
IEEE
14 years 2 months ago
Loop Scheduling with Complete Memory Latency Hiding on Multi-core Architecture
The widening gap between processor and memory performance is the main bottleneck for modern computer systems to achieve high processor utilization. In this paper, we propose a new...
Chun Xue, Zili Shao, Meilin Liu, Mei Kang Qiu, Edw...
AAAI
2004
13 years 10 months ago
Complete Local Search for Propositional Satisfiability
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
Hai Fang, Wheeler Ruml
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
14 years 1 months ago
Resolution Complete Rapidly-Exploring Random Trees
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
Peng Cheng, Steven M. LaValle