3875 search results - page 46 / 775 » Approximation algorithms for the 0-extension problem |
IPL
2000
14 years 9 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...
PR
1998
14 years 9 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
199
click to vote
INFOCOM
2012
IEEE
13 years 3 days ago
2012
IEEE
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
101
click to vote
AI
2011
Springer
14 years 4 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...