8540 search results - page 218 / 1708 » The Dynamic Servers Problem |
125
click to vote
ESA
2007
Springer
15 years 7 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...
124
click to vote
AIPS
2008
15 years 5 months ago
2008
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
131
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
94
Voted
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
A lot of image analysis problems lend themselves to a unified mathematical formulation as optimization problems. Tree-serial dynamic programming is a particular case of the so-cal...
115
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
— Achieving the Nash equilibria for single objective games is known to be a computationally difficult problem. However there is a special class of equilibria called evolutionary...