12519 search results - page 243 / 2504 » Approximation Problems Categories |
171
click to vote
IPCO
2010
15 years 5 months ago
2010
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of ad...
212
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
153
click to vote
ISLPED
2005
ACM
16 years 3 days ago
2005
ACM
ABSTRACT Motivated by data value locality and quality tolerance present in multimedia applications, we propose a new micro-architecture, Region-level Approximate Computation Buffer...
157
click to vote
SAT
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
152
click to vote
ICDM
2007
IEEE
16 years 26 days ago
2007
IEEE
We address a new learning problem where the goal is to build a predictive model that minimizes prediction time (the time taken to make a prediction) subject to a constraint on mod...