Sciweavers

828 search results - page 76 / 166
» Simplicial Powers of Graphs
Sort
View
IPPS
2002
IEEE
14 years 20 days ago
Distributed Spanner with Bounded Degree for Wireless Ad Hoc Networks
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...
Yu Wang 0003, Xiang-Yang Li
ASPDAC
2007
ACM
101views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Core-Based Testing of Multiprocessor System-on-Chips Utilizing Hierarchical Functional Buses
Abstract--An integrated test scheduling methodology for multiprocessor System-on-Chips (SOC) utilizing the functional buses for test data delivery is described. The proposed method...
Fawnizu Azmadi Hussin, Tomokazu Yoneda, Alex Orail...
AAAI
1997
13 years 9 months ago
Detecting Unsatisfiable CSPs by Coloring the Micro-Structure
Constraint satisfaction research has focussed on consistency checking using k-consistency and its variations such as arc-consistency, and path-consistency. We define a new form of...
Daya Ram Gaur, W. Ken Jackson, William S. Havens
WSC
1997
13 years 9 months ago
The VisSim/Discrete Event Modeling Environment
VisSim/Discrete Event is a process-oriented, discrete event modeling toolkit based on the powerful and proven graphical interface provided by the underlying VisSim simulation envi...
Herbert D. Schwetman, Arun Mulpur
CORR
2002
Springer
144views Education» more  CORR 2002»
13 years 7 months ago
Polynomial Time Data Reduction for Dominating Set
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
Jochen Alber, Michael R. Fellows, Rolf Niedermeier