Sciweavers

2181 search results - page 82 / 437
» The restriction scaffold problem
Sort
View
78
Voted
AAAI
2008
15 years 3 months ago
Efficient Learning of Action Schemas and Web-Service Descriptions
This work addresses the problem of efficiently learning action schemas using a bounded number of samples (interactions with the environment). We consider schemas in two languages-...
Thomas J. Walsh, Michael L. Littman
88
Voted
ACL
2006
15 years 2 months ago
Highly Constrained Unification Grammars
Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unificati...
Daniel Feinstein, Shuly Wintner
101
Voted
COLING
2000
15 years 2 months ago
Word Re-ordering and DP-based Search in Statistical Machine Translation
In this paper, we describe a search procedure for statistical machine translation (MT) based on dynmnic programming (DP). Starting from a DP-based solution to the traveling salesm...
Christoph Tillmann, Hermann Ney
AAAI
2010
15 years 1 months ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman
AOR
2006
99views more  AOR 2006»
15 years 26 days ago
On-line bin Packing with Two Item Sizes
The problem of on-line bin packing restricted to instances with only two item sizes (known in advance) has a well-known lower bound of 4/3 for its asymptotic competitive ratio. We...
Gregory Gutin, Tommy R. Jensen, Anders Yeo