Sciweavers

2124 search results - page 218 / 425
» An Efficient Framework for Order Optimization
Sort
View
HEURISTICS
2002
146views more  HEURISTICS 2002»
15 years 6 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
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...
CPM
2009
Springer
183views Combinatorics» more  CPM 2009»
15 years 4 months ago
Permuted Longest-Common-Prefix Array
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...
Juha Kärkkäinen, Giovanni Manzini, Simon...
EUROMICRO
2002
IEEE
15 years 11 months ago
Customer Choice in a Multi-Service Residential Access Network Environment
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,...
BTW
2005
Springer
108views Database» more  BTW 2005»
16 years 4 days ago
Integrating the Relational Interval Tree into IBM's DB2 Universal Database Server
: 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...
VLSID
2008
IEEE
133views VLSI» more  VLSID 2008»
16 years 7 months ago
Exhaustive Enumeration of Legal Custom Instructions for Extensible Processors
Today's customizable processors allow the designer to augment the base processor with custom accelerators. By choosing appropriate set of accelerators, designer can significa...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul