1486 search results - page 194 / 298 » Algorithms for two-box covering |
120
click to vote
CN
2008
15 years 4 months ago
2008
Service and resource discovery has become an integral part of modern networked systems. In this survey we give an overview of the existing solutions for service and resource discov...
115
click to vote
CONSTRAINTS
2007
15 years 4 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
144
click to vote
COR
2007
15 years 4 months ago
2007
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
142
click to vote
EOR
2007
15 years 4 months ago
2007
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
135
click to vote
TOCL
2008
15 years 4 months ago
2008
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...