1941 search results - page 221 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
166
click to vote
DAC
2010
ACM
15 years 7 months ago
2010
ACM
We study diagnosis of segments on speedpaths that fail the timing constraint at the post-silicon stage due to manufacturing variations. We propose a formal procedure that is appli...
183
click to vote
SLIP
2009
ACM
16 years 1 months ago
2009
ACM
The present paper is part of a larger effort to redesign, from the ground up, the best possible interconnect topologies for switchless multiprocessor computer systems. We focus he...
193
click to vote
TOPLAS
2010
15 years 5 months ago
2010
Pict project. We define two levels of abstraction as calculi with precise semantics: a low-level Nomadic π calculus with migration and location-dependent communication, and a hig...
203
Voted
WINET
2010
15 years 5 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
189
Voted
SIGMOD
2010
ACM
15 years 12 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...