Sciweavers

26496 search results - page 5247 / 5300
» An Approach to Computing Ethics
Sort
View
COR
2007
163views more  COR 2007»
14 years 9 months ago
A general heuristic for vehicle routing problems
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
David Pisinger, Stefan Ropke
IPL
2006
110views more  IPL 2006»
14 years 9 months ago
Variationally universal hashing
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
Ted Krovetz, Phillip Rogaway
JFP
2008
72views more  JFP 2008»
14 years 9 months ago
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Peter Sewell, Gareth Stoyle, Michael Hicks, Gavin ...
CPHYSICS
2007
106views more  CPHYSICS 2007»
14 years 9 months ago
The way towards thermonuclear fusion simulators
In parallel to the ITER project itself, many initiatives address complementary technological issues relevant to a fusion reactor, as well as many remaining scientific issues. One...
A. Bécoulet, Per Strand, H. Wilson, M. Roma...
JAIR
2006
179views more  JAIR 2006»
14 years 9 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
« Prev « First page 5247 / 5300 Last » Next »