Sciweavers

2109 search results - page 102 / 422
» Solving Necklace Constraint Problems
Sort
View
CPAIOR
2006
Springer
15 years 8 months ago
The Timetable Constrained Distance Minimization Problem
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be mi...
Rasmus V. Rasmussen, Michael A. Trick
COR
2006
120views more  COR 2006»
15 years 5 months ago
A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
Home health care, i.e. visiting and nursing patients in their homes, is a growing sector in the medical service business. From a staff rostering point of view, the problem is to f...
Stefan Bertels, Torsten Fahle
JMLR
2008
137views more  JMLR 2008»
15 years 5 months ago
Online Learning of Complex Prediction Problems Using Simultaneous Projections
We describe and analyze an algorithmic framework for online classification where each online trial consists of multiple prediction tasks that are tied together. We tackle the prob...
Yonatan Amit, Shai Shalev-Shwartz, Yoram Singer
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 9 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
158
Voted
CORR
2012
Springer
185views Education» more  CORR 2012»
14 years 21 days ago
Bayesian network learning with cutting planes
The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is considered. Learning is cast explicitly as an optimisatio...
James Cussens