Sciweavers

3907 search results - page 327 / 782
» Time, Knowledge, and Choice
Sort
View
SPAA
2005
ACM
16 years 10 days ago
Dynamic circular work-stealing deque
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...
David Chase, Yossi Lev
181
Voted
APPROX
2005
Springer
122views Algorithms» more  APPROX 2005»
16 years 10 days ago
Finding a Maximum Independent Set in a Sparse Random Graph
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
Uriel Feige, Eran Ofek
ATAL
2005
Springer
16 years 10 days ago
Negotiating over small bundles of resources
When rational but myopic agents negotiate over the exchange of indivisible resources, any restriction to the negotiation protocol may prevent the system from converging to a socia...
Yann Chevaleyre, Ulle Endriss, Jérôme...
GECCO
2005
Springer
175views Optimization» more  GECCO 2005»
16 years 9 days ago
An approach for QoS-aware service composition based on genetic algorithms
Web services are rapidly changing the landscape of software engineering. One of the most interesting challenges introduced by web services is represented by Quality Of Service (Qo...
Gerardo Canfora, Massimiliano Di Penta, Raffaele E...
HIPC
2005
Springer
16 years 9 days ago
Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors
Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing, computational biology and b...
David A. Bader, Kamesh Madduri