Sciweavers

728 search results - page 106 / 146
» Efficient Searching with Linear Constraints
Sort
View
AIPS
2008
15 years 8 months ago
Fast Planning for Dynamic Preferences
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
Brian Ziebart, Anind K. Dey, J. Andrew Bagnell
NAACL
2004
15 years 7 months ago
Improvements in Phrase-Based Statistical Machine Translation
In statistical machine translation, the currently best performing systems are based in some way on phrases or word groups. We describe the baseline phrase-based translation system...
Richard Zens, Hermann Ney
AICOM
2010
92views more  AICOM 2010»
15 years 6 months ago
SOLAR: An automated deduction system for consequence finding
SOLAR (SOL for Advanced Reasoning) is a first-order clausal consequence finding system based on the SOL (Skip Ordered Linear) tableau calculus. The ability to find non-trivial cons...
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue, O...
ICCAD
1995
IEEE
134views Hardware» more  ICCAD 1995»
15 years 9 months ago
A delay model for logic synthesis of continuously-sized networks
ng certain electrical noise and power constraints.Abstract: We present a new delay model for use in logic synthesis. A traditional model treats the area of a library cell as consta...
Joel Grodstein, Eric Lehman, Heather Harkness, Bil...
INFORMATICALT
2006
88views more  INFORMATICALT 2006»
15 years 6 months ago
Improving the Performances of Asynchronous Algorithms by Combining the Nogood Processors with the Nogood Learning Techniques
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...
Ionel Muscalagiu, Vladimir Cretu