Sciweavers

4744 search results - page 82 / 949
» Connected Computing
Sort
View
110
Voted
WCET
2008
15 years 3 months ago
Computing time as a program variable: a way around infeasible paths
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
Niklas Holsti
137
Voted
EUROPAR
2007
Springer
15 years 8 months ago
On the Connectivity of Bluetooth-Based Ad Hoc Networks
We study the connectivity properties of a family of random graphs which closely model the Bluetooth’s device discovery process, where each device tries to connect to other device...
Pilu Crescenzi, Carlo Nocentini, Andrea Pietracapr...
TROB
2008
159views more  TROB 2008»
15 years 2 months ago
Distributed Connectivity Control of Mobile Networks
Control of mobile networks raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In particular, in applications involving mobile senso...
Michael M. Zavlanos, George J. Pappas
118
Voted
GD
2004
Springer
15 years 8 months ago
Convex Drawings of 3-Connected Plane Graphs
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah
124
Voted
ICPPW
2002
IEEE
15 years 7 months ago
Statistical Analysis of Connectivity in Unidirectional Ad Hoc Networks
A unidirectional link exists in an ad-hoc network when a node B is within the transmission range of another node A while node A cannot directly hear node B. However, a reverse rou...
Venugopalan Ramasubramanian, Daniel Mossé