Sciweavers

1376 search results - page 45 / 276
» The Localization Hypothesis and Machines
Sort
View
EMNLP
2008
13 years 11 months ago
Triplet Lexicon Models for Statistical Machine Translation
This paper describes a lexical trigger model for statistical machine translation. We present various methods using triplets incorporating long-distance dependencies that can go be...
Sasa Hasan, Juri Ganitkevitch, Hermann Ney, Jes&ua...
IAT
2009
IEEE
14 years 4 months ago
Introducing Communication in Dis-POMDPs with Finite State Machines
Distributed Partially Observable Markov Decision Problems (DisPOMDPs) are emerging as a popular approach for modeling sequential decision making in teams operating under uncertain...
Yuki Iwanari, Makoto Tasaki, Makoto Yokoo, Atsushi...
ICRA
2008
IEEE
150views Robotics» more  ICRA 2008»
14 years 4 months ago
A Bayesian approach to empirical local linearization for robotics
— Local linearizations are ubiquitous in the control of robotic systems. Analytical methods, if available, can be used to obtain the linearization, but in complex robotics system...
Jo-Anne Ting, Aaron D'Souza, Sethu Vijayakumar, St...
CORR
2007
Springer
133views Education» more  CORR 2007»
13 years 10 months ago
On Decidability Properties of Local Sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
Olivier Finkel
JAIR
2000
123views more  JAIR 2000»
13 years 9 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill