14165 search results - page 241 / 2833 » The generalized two-server problem |
165
click to vote
IJCNN
2000
IEEE
15 years 10 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...
138
click to vote
IWMM
1998
Springer
15 years 10 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...
157
click to vote
ESA
2007
Springer
15 years 10 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...
148
Voted
GECCO
2006
Springer
15 years 9 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...
137
click to vote
AIPS
2008
15 years 8 months ago
2008
In this paper, we report on a new solver for large instances of the Disjunctive Temporal Problem (DTP). Our solver is based primarily on the idea of employing "compact" ...