Sciweavers

2100 search results - page 36 / 420
» Fundamentals of the problem
Sort
View
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
14 years 10 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
ATAL
2010
Springer
13 years 11 months ago
A quantified distributed constraint optimization problem
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
Toshihiro Matsui, Hiroshi Matsuo, Marius-Calin Sil...
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
14 years 4 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
SOFSEM
2009
Springer
14 years 7 months ago
Symbolic Reachability Analysis of Integer Timed Petri Nets
Petri nets are an effective formalism to model discrete event systems, and several variants have been defined to explicitly include real time in the model. We consider two fundam...
Min Wan, Gianfranco Ciardo
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
14 years 2 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...