Sciweavers

706 search results - page 13 / 142
» Online Interval Scheduling
Sort
View
ECAI
2010
Springer
13 years 7 months ago
Knowledge Compilation Using Interval Automata and Applications to Planning
Knowledge compilation [6, 5, 14, 8] consists in transforming a problem offline into a form which is tractable online. In this paper, we introduce new structures, based on the notio...
Alexandre Niveau, Hélène Fargier, C&...
COCOON
2007
Springer
13 years 11 months ago
An Improved Algorithm for Online Unit Clustering
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
Hamid Zarrabi-Zadeh, Timothy M. Chan
AOR
2006
77views more  AOR 2006»
13 years 7 months ago
Preemptive Scheduling with Position Costs
This paper is devoted to basic scheduling problems in which the scheduling cost of a job is not a function of its completion time. Instead, the cost is derived from the integratio...
Francis Sourd
CDC
2009
IEEE
191views Control Systems» more  CDC 2009»
14 years 9 days ago
Convergence and stability of a distributed CSMA algorithm for maximal network throughput
—Designing efficient scheduling algorithms is an important problem in a general class of networks with resourcesharing constraints, such as wireless networks and stochastic proc...
Libin Jiang, Jean C. Walrand
AAAI
1997
13 years 9 months ago
Effective Redundant Constraints for Online Scheduling
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
Lise Getoor, Greger Ottosson, Markus P. J. Fromher...