1480 search results - page 202 / 296 » Ants can solve constraint satisfaction problems |
159
click to vote
AGILEDC
2007
IEEE
16 years 24 days ago
2007
IEEE
A complex Enterprise Relationship Planning (ERP) data migration was in trouble: low quality, poor performance, instability, and an overworked team threatened project success. Faci...
157
click to vote
FOIKS
2008
Springer
15 years 8 months ago
2008
Springer
We present a method for decomposing a hypergraph with certain regularities into smaller hypergraphs. By applying this to the set of all canonical covers of a given set of functiona...
162
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
166
click to vote
TMC
2002
15 years 6 months ago
2002
This paper proposes a scheme of optimal resource management for reverse-link transmissions in multimedia wideband code-division multiple-access (WCDMA) communications. It is to gua...
172
click to vote
ESORICS
2010
Springer
15 years 6 months ago
2010
Springer
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applicat...