5316 search results - page 54 / 1064 » Which Search Problems Are Random |
117
Voted
COR
2010
15 years 27 days ago
2010
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
113
click to vote
COMPGEOM
1998
ACM
15 years 5 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
111
Voted
NETWORKS
2007
15 years 8 days ago
2007
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...
84
Voted
AIPS
2010
15 years 3 months ago
2010
We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approa...
96
Voted
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...