10608 search results - page 286 / 2122 » Complexity of O'Hara's Algorithm |
76
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...
101
click to vote
STOC
1994
ACM
15 years 4 months ago
1994
ACM
Recent work has shown many advantages to randomly wired expander-based networks. Unfortunately, the wiring complexity of such networks becomes physically problematic as they becom...
107
Voted
SODA
2003
ACM
15 years 1 months ago
2003
ACM
We consider the following question: Given a subdivision of space into n convex polyhedral cells, what is the worst-case complexity of a binary space partition (BSP) for the subdiv...
99
Voted
FOCM
2008
15 years 20 days ago
2008
Smale's 17th Problem asks "Can a zero of n complex polynomial equations in n unknowns be found approximately, on the average [for a suitable probability measure on the s...
111
Voted
CGI
1998
IEEE
15 years 4 months ago
1998
IEEE
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...