1278 search results - page 245 / 256 » The Complexity of Weighted Boolean |
SWAT
1992
Springer
14 years 23 days ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
ICDCS
2010
IEEE
14 years 19 days ago
2010
IEEE
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
AAAI
2008
13 years 11 months ago
2008
Security at major locations of economic or political importance is a key concern around the world, particularly given the threat of terrorism. Limited security resources prevent f...
ANTSW
2008
Springer
13 years 10 months ago
2008
Springer
An adaptive particle swarm optimization (APSO) that features better search efficiency than classical particle swarm optimization (PSO) is presented. More importantly, it can perfor...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...