Sciweavers

1220 search results - page 190 / 244
» Restricting grammatical complexity
Sort
View
JAIR
2008
145views more  JAIR 2008»
13 years 8 months ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein
IR
2006
13 years 8 months ago
Automatic question answering using the web: Beyond the Factoid
In this paper we describe and evaluate a Question Answering (QA) system that goes beyond answering factoid questions. Our approach to QA assumes no restrictions on the type of que...
Radu Soricut, Eric Brill
ITSSA
2006
182views more  ITSSA 2006»
13 years 8 months ago
Evaluation of a Multi-Agent System for Hospital Patient Scheduling
: The problem of patient scheduling in hospitals is characterized by high uncertainty and dynamics in patient treatments. Additional complexity in the planning and coordination pro...
Anja Zöller, Lars Braubach, Alexander Pokahr,...
JAIR
2006
110views more  JAIR 2006»
13 years 8 months ago
Modelling Mixed Discrete-Continuous Domains for Planning
In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl...
Maria Fox, Derek Long
JSAC
2008
133views more  JSAC 2008»
13 years 8 months ago
Distributed Rule-Regulated Spectrum Sharing
Dynamic spectrum access is a promising technique to use spectrum efficiently. Without being restricted to any prefixed spectrum bands, nodes choose operating spectrum ondemand. Suc...
Lili Cao, Haitao Zheng