3250 search results - page 468 / 650 » An Algorithm to Solve a Linear Program |
141
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
Evolutionary models typically rely on a single level of evolution for training a team of cooperating agents. I present a model that evolves at two levels—an “organizational”...
191
click to vote
CP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
185
click to vote
NCA
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper studies the optimal placement of web files for en-route web caching. It is shown that existing placement policies are all solving restricted partial problems of the ...
152
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
A reason to distribute constraint satisfaction is privacy: agents may not want to share their values, and they may wish to keep constraints as private as possible. In this paper, w...
164
click to vote
PEPM
1994
ACM
15 years 10 months ago
1994
ACM
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...