Sciweavers

1204 search results - page 196 / 241
» Termination of Polynomial Programs
Sort
View
IPCO
2007
126views Optimization» more  IPCO 2007»
14 years 11 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
NIPS
2003
14 years 11 months ago
Convex Methods for Transduction
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
Tijl De Bie, Nello Cristianini
ATAL
2010
Springer
14 years 11 months ago
To teach or not to teach?: decision making under uncertainty in ad hoc teams
In typical multiagent teamwork settings, the teammates are either programmed together, or are otherwise provided with standard communication languages and coordination protocols. ...
Peter Stone, Sarit Kraus
MP
2006
120views more  MP 2006»
14 years 9 months ago
Lot-sizing with production and delivery time windows
We study two different lot-sizing problems with time windows that have been proposed recently. For the case of production time windows, in which each client specific order must be ...
Laurence A. Wolsey
AI
2002
Springer
14 years 9 months ago
On the computational complexity of assumption-based argumentation for default reasoning
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni