67 search results - page 12 / 14 » Representing the space of linear programs as the Grassmann m... |
UAI
2004
13 years 8 months ago
2004
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
AI
2002
Springer
13 years 6 months ago
2002
Springer
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
ICPR
2002
IEEE
13 years 11 months ago
2002
IEEE
In this paper, a method to automatically extract the main information from a long-term electrocardiographic signal is presented. This method is based on techniques of pattern reco...
IJCAI
2003
13 years 8 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
PODS
1995
ACM
13 years 10 months ago
1995
ACM
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...