1547 search results - page 17 / 310 » Solving Knapsack Problems in a Sticker Based Model |
WSC
2008
13 years 9 months ago
2008
Combinatorial auctions, where buyers can bid on bundles of items rather than bidding them sequentially, often lead to more economically efficient allocations of financial resource...
AH
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. The virtual laboratory (VILAB) supports interactive problem solving in computer science with access to complex software-tools. During the problem solving processes the le...
ATAL
2004
Springer
14 years 27 days ago
2004
Springer
Distributed Constraint Optimization Problems (DCOP) have, for a long time, been considered an important research area for multi-agent systems because a vast number of realworld si...
ECAI
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
KCAP
2003
ACM
14 years 22 days ago
2003
ACM
In this paper we describe a generic library of problemsolving methods (PSMs) for scheduling applications. Although, some attempts have been made in the past at developing librarie...