Sciweavers

104 search results - page 19 / 21
» Tight Bounds for Point Recolouring
Sort
View
ANOR
2005
120views more  ANOR 2005»
14 years 11 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello
IJCAI
2007
15 years 1 months ago
A Study of Residual Supports in Arc Consistency
In an Arc Consistency (AC) algorithm, a residual support, or residue, is a support that has been stored during a previous execution of the procedure which determines if a value is ...
Christophe Lecoutre, Fred Hemery
90
Voted
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
15 years 12 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
15 years 6 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
LICS
2008
IEEE
15 years 6 months ago
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
Andrzej S. Murawski