172 search results - page 12 / 35 » A Framework for Optimal Sequential Planning in Multiagent Se... |
ICCBR
2010
Springer
13 years 11 months ago
2010
Springer
The vast majority of research on AI planning has focused on automated plan recognition, in which a planning agent is provided with a set of inputs that include an initial goal (or ...
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
There are many situations where an agent can perform one of several sets of actions in responses to changes in its environment, and the agent chooses to perform the set of actions...
ATAL
2011
Springer
12 years 7 months ago
2011
Springer
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
CCO
2001
Springer
14 years 1 days ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
ICCAD
1995
IEEE
13 years 11 months ago
1995
IEEE
Abstract—We propose the use of the logic S1S as a mathematical framework for studying the synthesis of sequential designs. We will show that this leads to simple and mathematical...