Sciweavers

1089 search results - page 74 / 218
» Bounds on generalized Frobenius numbers
Sort
View
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
14 years 1 months ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak
ECAI
2006
Springer
14 years 24 days ago
Coalition Structure Generation in Task-Based Settings
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multi-agent system...
Viet Dung Dang, Nicholas R. Jennings
ORL
2008
73views more  ORL 2008»
13 years 9 months ago
Polytopes and arrangements: Diameter and curvature
By analogy with the conjecture of Hirsch, we conjecture that the order of the largest total curvature of the central path associated to a polytope is the number of inequalities de...
Antoine Deza, Tamás Terlaky, Yuriy Zinchenk...
TWC
2008
109views more  TWC 2008»
13 years 9 months ago
Service Time Approximation in IEEE 802.11 Single-Hop Ad Hoc Networks
Abstract-- This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets success...
Atef Abdrabou, Weihua Zhuang
ISAAC
2010
Springer
291views Algorithms» more  ISAAC 2010»
13 years 7 months ago
A Tighter Analysis of Work Stealing
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, ...