16404 search results - page 81 / 3281 » A set coverage problem |
175
click to vote
ICDT
2005
ACM
15 years 11 months ago
2005
ACM
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
182
click to vote
JCO
1998
15 years 5 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
125
click to vote
ICPR
2008
IEEE
16 years 19 days ago
2008
IEEE
Many applications require matching objects to a predefined, yet highly dynamic set of categories accompanied by category descriptions. We present a novel approach to solving this...
132
click to vote
ICALP
2007
Springer
16 years 10 days ago
2007
Springer
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optim...
141
click to vote
ICRA
2005
IEEE
15 years 11 months ago
2005
IEEE
— We present a new sampling-based algorithm for iteratively locating Voronoi vertices of a point set in the unit cube Id = [0, 1]d . The algorithm takes an input sample and execu...