3341 search results - page 241 / 669 » On Bounded Queries and Approximation |
166
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
We consider the problem of broadcasting a large message in a large scale distributed platform. The message must be sent from a source node, with the help of the receiving peers whi...
156
click to vote
CPM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
164
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...
199
click to vote
CSR
2007
Springer
16 years 25 days ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
164
click to vote
APPROX
2005
Springer
16 years 5 days ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...