Sciweavers

3204 search results - page 229 / 641
» The Alcuin Number of a Graph
Sort
View
DAC
2006
ACM
16 years 7 months ago
SAT sweeping with local observability don't-cares
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
Qi Zhu, Nathan Kitchen, Andreas Kuehlmann, Alberto...
ICALP
2009
Springer
16 years 6 months ago
Rumor Spreading in Social Networks
Social networks are an interesting class of graphs likely to become of increasing importance in the future, not only theoretically, but also for its probable applications to ad hoc...
Flavio Chierichetti, Silvio Lattanzi, Alessandro P...
MOBIHOC
2007
ACM
16 years 6 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
ISPD
2010
ACM
249views Hardware» more  ISPD 2010»
16 years 1 months ago
A matching based decomposer for double patterning lithography
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
Yue Xu, Chris Chu
TACAS
2009
Springer
212views Algorithms» more  TACAS 2009»
16 years 1 months ago
Semantic Reduction of Thread Interleavings in Concurrent Programs
Abstract. We propose a static analysis framework for concurrent programs based on reduction of thread interleavings using sound invariants on the top of partial order techniques. S...
Vineet Kahlon, Sriram Sankaranarayanan, Aarti Gupt...