Sciweavers

4198 search results - page 41 / 840
» In search of lost time
Sort
View
PVLDB
2008
81views more  PVLDB 2008»
14 years 11 months ago
On efficiently searching trajectories and archival data for historical similarities
We study the problem of efficiently evaluating similarity queries on histories, where a history is a d-dimensional time
Reza Sherkat, Davood Rafiei
HEURISTICS
2002
152views more  HEURISTICS 2002»
14 years 11 months ago
A Constraint-Based Method for Project Scheduling with Time Windows
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
AIPS
2006
15 years 1 months ago
A New Principle for Incremental Heuristic Search: Theoretical Results
Planning is often not a one-shot task because either the world or the agent's knowledge of the world changes. In this paper, we introduce a new principle that can be used to ...
Sven Koenig, Maxim Likhachev
COCOON
2009
Springer
15 years 6 months ago
Sublinear-Time Algorithms for Tournament Graphs
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
Stefan S. Dantchev, Tom Friedetzky, Lars Nagel
COR
2006
80views more  COR 2006»
14 years 12 months ago
Multiple crossdocks with inventory and time windows
Crossdocking studies have mostly been concerned with the physical layout of a crossdock or on a single crossdock. In this work, we study a network of crossdocks taking into consid...
Ping Chen, Yunsong Guo, Andrew Lim, Brian Rodrigue...