Sciweavers

961 search results - page 102 / 193
» Automatic design synthesis with artificial intelligence tech...
Sort
View
AMAI
2000
Springer
15 years 5 months ago
On Solving Boolean Optimization with Satisfiability-Based Algorithms
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
Vasco M. Manquinho, João P. Marques Silva
CEC
2007
IEEE
15 years 7 months ago
Evolving cooperation in the non-iterated prisoner's dilemma: A social network inspired approach
— Online service provision is becoming increasingly decentralized as system designers pursue the benefits gained from utilizing nodes at the periphery of the network. However, d...
T. S. Ellis, X. Yao
IEEEICCI
2002
IEEE
15 years 6 months ago
Software Agents: Quality, Complexity and Uncertainty Issues
In software engineering community there is an increasing effort of design and development of multiagent systems (MAS). Among several issues emerging from this initiative, complexi...
Behrouz Homayoun Far
CP
2004
Springer
15 years 5 months ago
Unary Resource Constraint with Optional Activities
Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among thes...
Petr Vilím, Roman Barták, Ondrej Cep...
AIIDE
2009
15 years 2 months ago
Adapting Game-Playing Agents to Game Requirements
We examine the problem of self-adaptation in game-playing agents as the game requirements evolve incrementally. The goal of our current work is to develop an interactive environme...
Joshua Jones, Chris Parnin, Avik Sinharoy, Spencer...