Sciweavers

2139 search results - page 365 / 428
» Complexity of Agents and Complexity of Markets
Sort
View
AAAI
1998
15 years 7 months ago
Fast Transformation of Temporal Plans for Efficient Execution
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
Ioannis Tsamardinos, Nicola Muscettola, Paul H. Mo...
AAAI
1990
15 years 7 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih
JANCL
2007
115views more  JANCL 2007»
15 years 6 months ago
A logical characterisation of qualitative coalitional games
Qualitative coalitional games (QCGs) were introduced as abstract formal models of goal-oriented cooperative systems. A QCG is a game in which each agent is assumed to have some goa...
Paul E. Dunne, Wiebe van der Hoek, Michael Wooldri...
VLC
2008
156views more  VLC 2008»
15 years 6 months ago
An agent-based framework for sketched symbol interpretation
Recognizing hand-sketched symbols is a definitely complex problem. The input drawings are often intrinsically ambiguous, and require context to be interpreted in a correct way. Ma...
Giovanni Casella, Vincenzo Deufemia, Viviana Masca...
JAIR
2010
82views more  JAIR 2010»
15 years 4 months ago
Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints
Coalitional games serve the purpose of modeling payoff distribution problems in scenarios where agents can collaborate by forming coalitions in order to obtain higher worths than...
Gianluigi Greco, Enrico Malizia, Luigi Palopoli, F...