Sciweavers

10907 search results - page 53 / 2182
» Constraint Based Strategies
Sort
View
ARGMAS
2004
Springer
15 years 3 months ago
An Argument-Based Framework to Model an Agent's Beliefs in a Dynamic Environment
Abstract. One of the most difficult problems in multiagent systems involves representing knowledge and beliefs of agents in dynamic environments. New perceptions modify an agent’...
Marcela Capobianco, Carlos Iván Chesñ...
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
15 years 2 months ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
VLSID
1997
IEEE
135views VLSI» more  VLSID 1997»
15 years 1 months ago
Parallel Genetic Algorithms for Simulation-Based Sequential Circuit Test Generation
The problem of test generation belongs to the class of NP-complete problems and it is becoming more and more di cult as the complexity of VLSI circuits increases, and as long as e...
Dilip Krishnaswamy, Michael S. Hsiao, Vikram Saxen...
LFCS
2009
Springer
15 years 2 months ago
ATL with Strategy Contexts and Bounded Memory
We extend the alternating-time temporal logics ATL and ATL with strategy contexts and memory constraints: the first extension makes strategy quantifiers to not “forget” the s...
Thomas Brihaye, Arnaud Da Costa Lopes, Franç...
AI
2007
Springer
15 years 3 months ago
Multiagent Constraint Satisfaction with Multiply Sectioned Constraint Networks
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...
Yang Xiang, Wanling Zhang