This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
TORRENT is an EU-Supported Framework 5 project that is showing how intelligent control and negotiation capabilities can be built into access networks so as to give the residential...
Eric Scharf, Peter Hamer, Konstantinos Smparounis,...
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
Christoph Brochhaus, Jost Enderle, Achim Schlosser...
Today's customizable processors allow the designer to augment the base processor with custom accelerators. By choosing appropriate set of accelerators, designer can significa...