Sciweavers

4198 search results - page 53 / 840
» In search of lost time
Sort
View
HEURISTICS
2002
146views more  HEURISTICS 2002»
15 years 5 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...
ACL
2010
15 years 3 months ago
Dynamic Programming for Linear-Time Incremental Parsing
Incremental parsing techniques such as shift-reduce have gained popularity thanks to their efficiency, but there remains a major problem: the search is greedy and only explores a ...
Liang Huang, Kenji Sagae
CCCG
2010
15 years 7 months ago
Fast local searches and updates in bounded universes
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
AMC
2010
155views more  AMC 2010»
15 years 6 months ago
Temporally regularized direct numerical simulation
Experience with fluid-flow simulation suggests that, in some instances, under-resolved direct numerical simulation (DNS), without a residual-stress model per se but with artificial...
William J. Layton, C. David Pruett, Leo G. Rebholz
IPL
2008
80views more  IPL 2008»
15 years 5 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra