14386 search results - page 277 / 2878 » The Chinese Generals Problem |
135
Voted
LPAR
2001
Springer
15 years 9 months ago
2001
Springer
When writing a constraint program, we have to decide what to make the decision variable, and how to represent the constraints on these variables. In many cases, there is considerab...
149
click to vote
IJCNN
2000
IEEE
15 years 9 months ago
2000
IEEE
In our recent work, a general method called the stable state analysis technique was developed to determine constraints that the weights in the Hopfield energy function must satisf...
124
click to vote
IWMM
1998
Springer
15 years 9 months ago
1998
Springer
We show that for 8 real and varied C and C++ programs, several conventional dynamic storage allocators provide nearzero fragmentation, once we account for overheads due to impleme...
138
click to vote
ESA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
130
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...