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...
— 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...
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...
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...
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...