874 search results - page 83 / 175 » Computing Weighted Solutions in Answer Set Programming |
108
click to vote
CEC
2009
IEEE
15 years 7 months ago
2009
IEEE
—This paper presents the evolutionary programming with an ensemble of memories to deal with optimization problems in dynamic environments. The proposed algorithm modifies a recen...
111
click to vote
GPEM
2008
15 years 1 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
ECAI
2006
Springer
15 years 4 months ago
2006
Springer
Bounding constraints are used to bound the tolerance of solutions under certain undesirable features. Standard solvers propagate them one by one. Often times, it is easy to satisfy...
102
click to vote
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...
106
click to vote
VLDB
2002
ACM
15 years 17 days ago
2002
ACM
Safe programming languages encourage the development of dynamically extensible systems, such as extensible Web servers and mobile agent platforms. Although protection is of utmost...