Sciweavers

2314 search results - page 447 / 463
» Minimal Partitions of a Graph
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
Hailiang Mei, Pravin Pawar, Ing Widya
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 23 days ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
14 years 23 days ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 19 days ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
DATE
2010
IEEE
160views Hardware» more  DATE 2010»
14 years 14 days ago
Soft error-aware design optimization of low power and time-constrained embedded systems
— In this paper, we examine the impact of application task mapping on the reliability of MPSoC in the presence of single-event upsets (SEUs). We propose a novel soft erroraware d...
Rishad A. Shafik, Bashir M. Al-Hashimi, Krishnendu...