2125 search results - page 282 / 425 » On Graph Complexity |
91
Voted
CONCUR
2004
Springer
15 years 8 months ago
2004
Springer
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
104
Voted
CAEPIA
2007
Springer
15 years 6 months ago
2007
Springer
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...
NIPS
2000
15 years 3 months ago
2000
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...
126
Voted
FLAIRS
2007
15 years 4 months ago
2007
Reasoning with hypothetical cases helps decision-makers evaluate alternate hypotheses for deciding a case. The hypotheticals demonstrate the sensitivity of a hypothesis to apparen...
91
Voted
AAAI
1998
15 years 3 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...