3341 search results - page 470 / 669 » On Bounded Queries and Approximation |
197
click to vote
ESA
1993
Springer
15 years 10 months ago
1993
Springer
The problem of maintaining an approximate solution for one-dimensional bin packing when items may arrive and depart dynamically is studied. In accordance with various work on fully...
152
click to vote
AAAI
2008
15 years 9 months ago
2008
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
184
click to vote
AAAI
2008
15 years 9 months ago
2008
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...
208
click to vote
LATIN
2010
Springer
15 years 8 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...
171
click to vote
ALENEX
2010
15 years 8 months ago
2010
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...