Sciweavers

350 search results - page 52 / 70
» Complexity of Planning with Partial Observability
Sort
View
AAAI
1998
13 years 9 months ago
Two Forms of Dependence in Propositional Logic: Controllability and Definability
We investigate two forms of dependence between variables and/or formulas within a propositional knowledge base: controllability (a set of variables X controls a formula , if there...
Jérôme Lang, Pierre Marquis
ICMCS
2009
IEEE
149views Multimedia» more  ICMCS 2009»
13 years 5 months ago
A multi-agent framework for a hybrid dialog management system
The importance of dialog management systems has increased in recent years. Dialog systems are created for domain specific applications, so that a high demand for a flexible dialog...
Stefan Schwärzler, Joachim Schenk, Günth...
FEDCSIS
2011
76views more  FEDCSIS 2011»
12 years 7 months ago
Search--Based Testing, the Underlying Engine of Future Internet Testing
Abstract—The Future Internet will be a complex interconnection of services, applications, content and media, on which our society will become increasingly dependent. Time to mark...
Arthur I. Baars, Kiran Lakhotia, Tanja E. J. Vos, ...
ICML
2002
IEEE
14 years 8 months ago
Learning from Scarce Experience
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
Leonid Peshkin, Christian R. Shelton
IJCAI
2007
13 years 9 months ago
Argumentation Based Contract Monitoring in Uncertain Domains
Few existing argumentation frameworks are designed to deal with probabilistic knowledge, and none are designed to represent possibilistic knowledge, making them unsuitable for man...
Nir Oren, Timothy J. Norman, Alun D. Preece