Sciweavers

578 search results - page 79 / 116
» The Minimum-Entropy Set Cover Problem
Sort
View
PODC
2005
ACM
15 years 3 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
AAAI
2008
15 years 5 days ago
Zero-data Learning of New Tasks
We introduce the problem of zero-data learning, where a model must generalize to classes or tasks for which no training data are available and only a description of the classes or...
Hugo Larochelle, Dumitru Erhan, Yoshua Bengio
AOR
2010
14 years 7 months ago
Solutions diversification in a column generation algorithm
Column generation algorithms have been specially designed for solving mathematical programs with a huge number of variables. Unfortunately, this method suffers from slow convergen...
Nora Touati Moungla, Lucas Létocart, Anass ...
EOR
2007
198views more  EOR 2007»
14 years 9 months ago
Airline crew scheduling from planning to operations
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...
Claude P. Medard, Nidhi Sawhney
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
15 years 1 months ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...