Sciweavers

4171 search results - page 786 / 835
» Choice numbers of graphs
Sort
View
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 5 months 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
LCN
2003
IEEE
15 years 5 months ago
ReInForM: Reliable Information Forwarding Using Multiple Paths in Sensor Networks
Sensor networks are meant for sensing and disseminating information about the environment they sense. The criticality of a sensed phenomenon determines it’s importance to the en...
Budhaditya Deb, Sudeept Bhatnagar, Badri Nath
DATE
2010
IEEE
160views Hardware» more  DATE 2010»
15 years 5 months 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...
PASTE
2010
ACM
15 years 4 months ago
Opportunities for concurrent dynamic analysis with explicit inter-core communication
Multicore is now the dominant processor trend, and the number of cores is rapidly increasing. The paradigm shift to multicore forces the redesign of the software stack, which incl...
Jungwoo Ha, Stephen P. Crago
IPPS
1999
IEEE
15 years 4 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...