Sciweavers

110 search results - page 19 / 22
» Improving Coevolutionary Search for Optimal Multiagent Behav...
Sort
View
JAIR
2007
141views more  JAIR 2007»
13 years 6 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
ICCAD
1997
IEEE
121views Hardware» more  ICCAD 1997»
13 years 11 months ago
Adaptive methods for netlist partitioning
An algorithm that remains in use at the core of many partitioning systems is the Kernighan-Lin algorithm and a variant the Fidducia-Matheysses (FM) algorithm. To understand the FM...
Wray L. Buntine, Lixin Su, A. Richard Newton, Andr...
CN
2000
98views more  CN 2000»
13 years 6 months ago
Dynamic pricing by software agents
We envision a future in which the global economy and the Internet will merge and evolve together into an information economy bustling with billions of economically motivated softw...
Jeffrey O. Kephart, James E. Hanson, Amy R. Greenw...
ATAL
2006
Springer
13 years 10 months ago
Resource allocation among agents with preferences induced by factored MDPs
Distributing scarce resources among agents in a way that maximizes the social welfare of the group is a computationally hard problem when the value of a resource bundle is not lin...
Dmitri A. Dolgov, Edmund H. Durfee
ATAL
2003
Springer
13 years 12 months ago
Cooperative negotiation for soft real-time distributed resource allocation
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
Roger Mailler, Victor R. Lesser, Bryan Horling