Sciweavers

2100 search results - page 79 / 420
» Observation Can Be as Effective as Action in Problem Solving
Sort
View
SARA
2009
Springer
14 years 3 months ago
Common Subexpressions in Constraint Models of Planning Problems
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
14 years 2 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
AIPS
2008
13 years 11 months ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan
IAT
2008
IEEE
14 years 3 months ago
Intent-Driven Insider Threat Detection in Intelligence Analyses
In intelligence analysis, information plays an important role in solving problems and making decisions. However, an increasing number of malicious behaviors, most of which come fr...
Eugene Santos Jr., Hien Nguyen, Fei Yu, Keum Joo K...
STACS
2010
Springer
14 years 3 months ago
On Iterated Dominance, Matrix Elimination, and Matched Paths
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
Felix Brandt, Felix A. Fischer, Markus Holzer