Sciweavers

5473 search results - page 1038 / 1095
» On the graph isomorphism problem
Sort
View
ITC
2003
IEEE
148views Hardware» more  ITC 2003»
14 years 4 months ago
HyAC: A Hybrid Structural SAT Based ATPG for Crosstalk
As technology evolves into the deep sub-micron era, signal integrity problems are growing into a major challenge. An important source of signal integrity problems is the crosstalk...
Xiaoliang Bai, Sujit Dey, Angela Krstic
PODC
2003
ACM
14 years 4 months ago
Geometric ad-hoc routing: of theory and practice
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Z...
TAMC
2009
Springer
14 years 3 months ago
On the Complexity of the Multiple Stack TSP, kSTSP
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
Sophie Toulouse, Roberto Wolfler Calvo
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
14 years 3 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
IPPS
1999
IEEE
14 years 3 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...
« Prev « First page 1038 / 1095 Last » Next »