2681 search results - page 198 / 537 » Problem F |
77
Voted
SWAT
1998
Springer
15 years 4 months ago
1998
Springer
We study the complexity of the motion planning problem for a bounded-reach robot in the situation where the n obstacles in its workspace satisfy two of the realistic models propos...
174
click to vote
PODC
1993
ACM
15 years 4 months ago
1993
ACM
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
116
click to vote
CIKM
2006
Springer
15 years 4 months ago
2006
Springer
Classification algorithms and document representation approaches are two key elements for a successful document classification system. In the past, much work has been conducted to...
COCO
1991
Springer
15 years 4 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
108
click to vote
AAAI
2010
15 years 2 months ago
2010
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...