Sciweavers

14158 search results - page 377 / 2832
» Generalized switch-setting problems
Sort
View
ACL
2011
14 years 8 months ago
Word Alignment via Submodular Maximization over Matroids
We cast the word alignment problem as maximizing a submodular function under matroid constraints. Our framework is able to express complex interactions between alignment component...
Hui Lin, Jeff Bilmes
AAAI
2011
14 years 4 months ago
Termination and Correctness Analysis of Cyclic Control
The utility of including cyclic flow of control in plans has been long recognized by the planning community. Loops in a plan increase both its applicability and the compactness o...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
185
Voted
CORR
2006
Springer
140views Education» more  CORR 2006»
15 years 4 months ago
Nearly optimal exploration-exploitation decision thresholds
While in general trading off exploration and exploitation in reinforcement learning is hard, under some formulations relatively simple solutions exist. Optimal decision thresholds ...
Christos Dimitrakakis
STACS
2004
Springer
15 years 10 months ago
Lattices with Many Cycles Are Dense
Abstract We give a method for approximating any n-dimensional lattice with a lattice Λ whose factor group Zn /Λ has n − 1 cycles of equal length with arbitrary precision. We al...
Mårten Trolin
ECAI
1998
Springer
15 years 9 months ago
On Non-Conservative Plan Modification
The problem of minimally modifying a plan in response to changes in the specification of the planning problem has already been investigated in the literature. In this paper we cons...
Paolo Liberatore