Sciweavers

3967 search results - page 721 / 794
» Distributed Games and Distributed Control for Asynchronous S...
Sort
View
SPAA
1996
ACM
14 years 1 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
PDIS
1994
IEEE
14 years 1 months ago
Achieving Transaction Scaleup on Unix
Constructing scalable high-performance applications on commodity hardware running the Unix operating system is a problem that must be addressed in several application domains. We ...
Marie-Anne Neimat, Donovan A. Schneider
ATAL
2009
Springer
14 years 27 days ago
Effective bidding and deal identification for negotiations in highly nonlinear scenarios
Most real-world negotiation scenarios involve multiple, interdependent issues. These scenarios are specially challenging because the agents' utility functions are nonlinear, ...
Ivan Marsá-Maestre, Miguel A. López-...
ATAL
2006
Springer
14 years 19 days 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
GECCO
2006
Springer
195views Optimization» more  GECCO 2006»
14 years 16 days ago
Studying XCS/BOA learning in Boolean functions: structure encoding and random Boolean functions
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
Martin V. Butz, Martin Pelikan