Sciweavers

2976 search results - page 510 / 596
» On the bounded integer programming
Sort
View
SAC
2010
ACM
13 years 8 months ago
Efficient mapping and voltage islanding technique for energy minimization in NoC under design constraints
Voltage islanding technique in Network-on-Chip (NoC) can significantly reduce the computational energy consumption by scaling down the voltage levels of the processing elements (P...
Pavel Ghosh, Arunabha Sen
STOC
2010
ACM
181views Algorithms» more  STOC 2010»
13 years 8 months ago
Load balancing and orientability thresholds for random hypergraphs
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
Pu Gao, Nicholas C. Wormald
BMCBI
2010
156views more  BMCBI 2010»
13 years 8 months ago
Protein complex prediction via verifying and reconstructing the topology of domain-domain interactions
Background: High-throughput methods for detecting protein-protein interactions enable us to obtain large interaction networks, and also allow us to computationally identify the as...
Yosuke Ozawa, Rintaro Saito, Shigeo Fujimori, Hisa...
CN
2008
106views more  CN 2008»
13 years 7 months ago
Efficient virtual-backbone routing in mobile ad hoc networks
Since the physical topology of Mobile Ad hoc Networks (MANETs) is generally unstable, an appealing approach is the construction of a stable and robust virtual topology or backbone...
Jamal N. Al-Karaki, Ahmed E. Kamal
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 7 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner