3875 search results - page 321 / 775 » Approximation algorithms for the 0-extension problem |
169
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
Bayesian estimation in nonlinear stochastic dynamical systems has been addressed for a long time. Among other solutions, Particle Filtering (PF) algorithms propagate in time a Mon...
235
click to vote
LATIN
2010
Springer
15 years 9 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
197
click to vote
ALGOSENSORS
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
217
click to vote
STACS
2005
Springer
16 years 25 days ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
206
click to vote
IJCAI
2007
15 years 8 months ago
2007
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...