Sciweavers

3406 search results - page 159 / 682
» General Search Algorithms for Energy Minimization Problems
Sort
View
155
Voted
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
14 years 6 months ago
FlexMin: a flexible tool for automatic bug isolation in DBMS software
Debugging a database engine is an arduous task due to the complexity of the query workloads and systems. The first step in isolating a bug involves identifying a sequence of step...
Kristi Morton, Nicolas Bruno
EOR
2006
83views more  EOR 2006»
15 years 3 months ago
Lower bounds and heuristic algorithms for the k
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
Mauro Dell'Amico, Manuel Iori, Silvano Martello, M...
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
15 years 5 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa
181
Voted
TASE
2010
IEEE
14 years 10 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
146
Voted
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 3 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy