Sciweavers

810 search results - page 2 / 162
» Solving Time-Dependent Planning Problems
Sort
View
ACL
2009
13 years 5 months ago
Quadratic-Time Dependency Parsing for Machine Translation
Efficiency is a prime concern in syntactic MT decoding, yet significant developments in statistical parsing with respect to asymptotic efficiency haven't yet been explored in...
Michel Galley, Christopher D. Manning
NECO
2007
258views more  NECO 2007»
13 years 7 months ago
Reinforcement Learning Through Modulation of Spike-Timing-Dependent Synaptic Plasticity
The persistent modification of synaptic efficacy as a function of the relative timing of pre- and postsynaptic spikes is a phenomenon known as spiketiming-dependent plasticity (...
Razvan V. Florian
AIPS
2008
13 years 10 months ago
Using Classical Planners to Solve Nondeterministic Planning Problems
Researchers have developed a huge number of algorithms to solve classical planning problems. We provide a way to use these algorithms, unmodified, to generate strong-cyclic soluti...
Ugur Kuter, Dana S. Nau, Elnatan Reisner, Robert P...
CEEMAS
2007
Springer
14 years 2 months ago
Simulating a Human Cooperative Problem Solving
Abstract. We are interested in understanding and simulating how humans elaborate plans in situations where knowledge is incomplete and how they interact to obtain missing informati...
Alexandre Pauchet, Amal El Fallah-Seghrouchni, Nat...
ATAL
2005
Springer
14 years 1 months ago
A distributed framework for solving the Multiagent Plan Coordination Problem
We examine whether and how the Multiagent Plan Coordination Problem, the problem of resolving interactions between the plans of multiple agents, can be cast as a Distributed Const...
Jeffrey S. Cox, Edmund H. Durfee, Thomas Bartold