Sciweavers

360 search results - page 46 / 72
» The TV-Break Packing Problem
Sort
View
61
Voted
ICML
2005
IEEE
15 years 10 months ago
Hedged learning: regret-minimization with learning experts
In non-cooperative multi-agent situations, there cannot exist a globally optimal, yet opponent-independent learning algorithm. Regret-minimization over a set of strategies optimiz...
Yu-Han Chang, Leslie Pack Kaelbling
FCT
2007
Springer
15 years 3 months ago
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
AAAI
2007
14 years 12 months ago
Action-Space Partitioning for Planning
For autonomous artificial decision-makers to solve realistic tasks, they need to deal with searching through large state and action spaces under time pressure. We study the probl...
Natalia Hernandez-Gardiol, Leslie Pack Kaelbling
CORR
2008
Springer
95views Education» more  CORR 2008»
14 years 9 months ago
The Plane-Width of Graphs
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
Marcin Kaminski, Paul Medvedev, Martin Milanic
EMNLP
2009
14 years 7 months ago
A Compact Forest for Scalable Inference over Entailment and Paraphrase Rules
A large body of recent research has been investigating the acquisition and application of applied inference knowledge. Such knowledge may be typically captured as entailment rules...
Roy Bar-Haim, Jonathan Berant, Ido Dagan