4035 search results - page 224 / 807 » Useless Actions Are Useful |
139
click to vote
AIPS
2009
15 years 7 months ago
2009
The FF relaxed plan heuristic is one of the most effective techniques in domain-independent satisficing planning and is used by many state-of-the-art heuristic-search planners. Ho...
169
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
A set of vertices S is a determining set for a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of a graph is the size of a sma...
186
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Conditional random fields (CRFs) are graphical models for modeling the probability of labels given the observations. They have traditionally been trained with using a set of obser...
150
click to vote
CALCO
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. We present a coalgebraic semantics for reasoning about information update in multi-agent systems. The novelty is that we have one structure for both states and actions an...
151
click to vote
ACMDIS
2004
ACM
16 years 10 hour ago
2004
ACM
Speech-based applications commonly come with web-based or printed manuals. Alternatively, the dialogue can be designed so that users should be able to start using the application ...