Sciweavers

3913 search results - page 659 / 783
» complexity 2006
Sort
View
131
Voted
EDBT
2006
ACM
174views Database» more  EDBT 2006»
16 years 3 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
127
Voted
MOBIHOC
2006
ACM
16 years 3 months ago
DRAND: : distributed randomized TDMA scheduling for wireless ad-hoc networks
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
Injong Rhee, Ajit Warrier, Jeongki Min, Lisong Xu
103
Voted
EUROSYS
2006
ACM
16 years 23 days ago
Thorough static analysis of device drivers
Bugs in kernel-level device drivers cause 85% of the system crashes in the Windows XP operating system [44]. One of the sources of these errors is the complexity of the Windows dr...
Thomas Ball, Ella Bounimova, Byron Cook, Vladimir ...
142
Voted
ICCD
2006
IEEE
97views Hardware» more  ICCD 2006»
16 years 18 days ago
Pesticide: Using SMT Processors to Improve Performance of Pointer Bug Detection
Pointer bugs associated with dynamically-allocated objects resulting in out-of-bounds memory access are an important class of software bugs. Because such bugs cannot be detected e...
Jin-Yi Wang, Yen-Shiang Shue, T. N. Vijaykumar, Sa...
130
Voted
ICCAD
2006
IEEE
127views Hardware» more  ICCAD 2006»
16 years 17 days ago
Joint design-time and post-silicon minimization of parametric yield loss using adjustable robust optimization
Parametric yield loss due to variability can be effectively reduced by both design-time optimization strategies and by adjusting circuit parameters to the realizations of variable...
Murari Mani, Ashish Kumar Singh, Michael Orshansky