633 search results - page 22 / 127 » Locality and Hard SAT-Instances |
ICDCS
2008
IEEE
14 years 4 months ago
2008
IEEE
—The proliferation of wireless and mobile devices has fostered the demand for context-aware applications, in which location is one of the most significant contexts. Multilaterati...
IROS
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— Robust vision-based grasping is still a hard problem for humanoid robot systems. When being restricted to using the camera system built-in into the robot’s head for o...
UIST
2006
ACM
14 years 3 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
AI
2003
Springer
14 years 3 months ago
2003
Springer
The multi-processor total tardiness problem (MPTTP) is an ÆÈ-hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a numb...
TIME
1994
IEEE
14 years 1 months ago
1994
IEEE
We are concerned with temporalreasoning problems where there is uncertainty about the order in which events occur. The task of temporal reasoning is to derive an event sequence co...