526 search results - page 74 / 106 » Increments of Random Partitions |
SIGECOM
2003
ACM
14 years 1 months ago
2003
ACM
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...
CEC
2009
IEEE
14 years 1 months ago
2009
IEEE
— The bootstrap problem is often recognized as one of the main challenges of evolutionary robotics: if all individuals from the first randomly generated population perform equal...
COOPIS
1999
IEEE
14 years 24 days ago
1999
IEEE
A distributed multimedia information system allows users to access data of different modalities, from different data sources, ranked by various combinationsof criteria. In [6], Fa...
SPAA
1990
ACM
14 years 15 days ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
HIPC
2007
Springer
14 years 10 days ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...