Sciweavers

3049 search results - page 462 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
ICDT
2003
ACM
91views Database» more  ICDT 2003»
15 years 9 months ago
Reformulation of XML Queries and Constraints
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
Alin Deutsch, Val Tannen
ASPDAC
1995
ACM
108views Hardware» more  ASPDAC 1995»
15 years 7 months ago
Synthesis-for-testability using transformations
- We address the problem of transforming a behavioral specification so that synthesis of a testable implementation from the new specification requires significantly less area and ...
Miodrag Potkonjak, Sujit Dey, Rabindra K. Roy
NAACL
2007
15 years 5 months ago
Randomized Decoding for Selection-and-Ordering Problems
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
Pawan Deshpande, Regina Barzilay, David R. Karger
UAI
2008
15 years 5 months ago
CORL: A Continuous-state Offset-dynamics Reinforcement Learner
Continuous state spaces and stochastic, switching dynamics characterize a number of rich, realworld domains, such as robot navigation across varying terrain. We describe a reinfor...
Emma Brunskill, Bethany R. Leffler, Lihong Li, Mic...
AIPS
2006
15 years 5 months ago
Goal Achievement in Partially Known, Partially Observable Domains
We present a decision making algorithm for agents that act in partially observable domains which they do not know fully. Making intelligent choices in such domains is very difficu...
Allen Chang, Eyal Amir