Sciweavers

13603 search results - page 2545 / 2721
» On the Complexity of Computing Treelength
Sort
View
WCRE
2003
IEEE
15 years 11 months ago
Toward an environment for comprehending distributed systems
Many modern software systems are often large, distributed, written in more than one programming language, and developed using pre-built components. This paper presents the results...
Maher Salah, Spiros Mancoridis
DAC
2003
ACM
15 years 11 months ago
Instruction set compiled simulation: a technique for fast and flexible instruction set simulation
Instruction set simulators are critical tools for the exploration and validation of new programmable architectures. Due to increasing complexity of the architectures and timeto-ma...
Mehrdad Reshadi, Prabhat Mishra, Nikil D. Dutt
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
15 years 11 months 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
IMC
2003
ACM
15 years 11 months ago
Constructing internet coordinate system based on delay measurement
In this paper, we consider the problem of how to represent the locations of Internet hosts in a Cartesian coordinate system to facilitate estimate of the network distance between ...
Hyuk Lim, Jennifer C. Hou, Chong-Ho Choi
MOBICOM
2003
ACM
15 years 11 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
« Prev « First page 2545 / 2721 Last » Next »