Sciweavers

6455 search results - page 407 / 1291
» Research problems
Sort
View
IJCAI
2007
15 years 8 months ago
Using Linear Programming for Bayesian Exploration in Markov Decision Processes
A key problem in reinforcement learning is finding a good balance between the need to explore the environment and the need to gain rewards by exploiting existing knowledge. Much ...
Pablo Samuel Castro, Doina Precup
SODA
2008
ACM
156views Algorithms» more  SODA 2008»
15 years 8 months ago
Approximating TSP on metrics with bounded global growth
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
T.-H. Hubert Chan, Anupam Gupta
DLOG
2006
15 years 8 months ago
On the Scalability of Description Logic Instance Retrieval
Abstract Practical description logic systems play an ever-growing role for knowledge representation and reasoning research even in distributed environments. In particular, the onto...
Ralf Möller, Volker Haarslev, Michael Wessel
DS
1997
104views Database» more  DS 1997»
15 years 8 months ago
Managing Constraint Violations in Administrative Information Systems
This paper motivates a comprehensive methodological framework for dealing with some aspects of real-world complexity in information system analysis and design. By complex applicat...
I. Boydens, Alain Pirotte, Esteban Zimányi
AIPS
1996
15 years 8 months ago
TRAINS-95: Towards a Mixed-Initiative Planning Assistant
We have been examining mixed-initiative planning systems in the context of command and control or logistical overview situations. In such environments, the human and the computer ...
George Ferguson, James F. Allen, Bradford W. Mille...