Sciweavers

1940 search results - page 220 / 388
» Search with Synonyms: Problems and Solutions
Sort
View
EPIA
2007
Springer
16 years 23 days ago
Improving Evolutionary Algorithms with Scouting
The goal of an Evolutionary Algorithm(EA) is to find the optimal solution to a given problem by evolving a set of initial potential solutions. When the problem is multi-modal, an ...
Konstantinos Bousmalis, Gillian M. Hayes, Jeffrey ...
IAT
2006
IEEE
16 years 19 days ago
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
Viswanath Avasarala, Himanshu Polavarapu, Tracy Mu...
AAAI
1996
15 years 8 months ago
Neighborhood Inverse Consistency Preprocessing
Constraint satisfaction consistency preprocessing methods are used to reduce search e ort. Time and especially space costs limit the amount of preprocessing that will be cost e ec...
Eugene C. Freuder, Charles D. Elfe
ATAL
2010
Springer
15 years 7 months ago
Point-based policy generation for decentralized POMDPs
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen
TEC
2002
152views more  TEC 2002»
15 years 6 months ago
Ant colony optimization for resource-constrained project scheduling
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...
Daniel Merkle, Martin Middendorf, Hartmut Schmeck