3433 search results - page 293 / 687 » Heuristics for a bidding problem |
187
click to vote
CHARME
2001
Springer
15 years 10 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
176
click to vote
EVOW
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we study a complex real world workforce scheduling problem. We apply constructive search and variable neighbourhood search (VNS) metaheuristics and enhance these meth...
169
click to vote
AIPS
2009
15 years 7 months ago
2009
In this paper a planning framework based on Ant Colony Optimization techniques is presented. It is well known that finding optimal solutions to planning problems is a very hard co...
205
click to vote
CSC
2009
15 years 7 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
151
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...