2446 search results - page 32 / 490 » Choiceless Polynomial Time |
FOCS
2002
IEEE
14 years 15 days ago
2002
IEEE
We provide the first polynomial time algorithm for the linear version of a market equilibrium model defined by Irving Fisher in 1891, thereby partially answering an open questio...
ICRA
2000
IEEE
13 years 12 months ago
2000
IEEE
This paper describes a new collision detection algorithm designed for interactive manipulation in virtual environments. Making some assumptions on objects motion, the collision ti...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
ISAAC
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...