Sciweavers

4843 search results - page 434 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
ICALP
1999
Springer
15 years 9 months ago
Stable Marriage with Incomplete Lists and Ties
The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and seve...
Kazuo Iwama, David Manlove, Shuichi Miyazaki, Yasu...
132
Voted
AIPS
2007
15 years 7 months ago
Discovering Relational Domain Features for Probabilistic Planning
In sequential decision-making problems formulated as Markov decision processes, state-value function approximation using domain features is a critical technique for scaling up the...
Jia-Hong Wu, Robert Givan
140
Voted
IPCO
2007
98views Optimization» more  IPCO 2007»
15 years 6 months ago
Scheduling with Precedence Constraints of Low Fractional Dimension
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
Christoph Ambühl, Monaldo Mastrolilli, Nikola...
NIPS
2008
15 years 6 months ago
Structured ranking learning using cumulative distribution networks
Ranking is at the heart of many information retrieval applications. Unlike standard regression or classification in which we predict outputs independently, in ranking we are inter...
Jim C. Huang, Brendan J. Frey
171
Voted
GECCO
2008
Springer
177views Optimization» more  GECCO 2008»
15 years 6 months ago
Reduced computation for evolutionary optimization in noisy environment
Evolutionary Algorithms’ (EAs’) application to real world optimization problems often involves expensive fitness function evaluation. Naturally this has a crippling effect on ...
Maumita Bhattacharya