Sciweavers

584 search results - page 64 / 117
» Combinatorial optimization problems in wireless switch desig...
Sort
View
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
14 years 9 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
SMA
2005
ACM
104views Solid Modeling» more  SMA 2005»
14 years 2 months ago
Packing a trunk: now with a twist!
In an industry project with a German car manufacturer we are faced with the challenge of placing a maximum number of uniform rigid rectangular boxes in the interior of a car trunk...
Friedrich Eisenbrand, Stefan Funke, Andreas Karren...
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
TMC
2008
104views more  TMC 2008»
13 years 9 months ago
Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks
In this paper, we consider multihop wireless mesh networks, where each router node is equipped with multiple radio interfaces, and multiple channels are available for communication...
Anand Prabhu Subramanian, Himanshu Gupta, Samir R....
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 9 months ago
Maximally Radio-Disjoint Multipath Routing for Wireless Multimedia Sensor Networks
In wireless sensor networks, bandwidth is one of precious resources to multimedia applications. To get more bandwidth, multipath routing is one appropriate solution provided that ...
Moufida Maimour