Sciweavers

7853 search results - page 1274 / 1571
» Learning from Each Other
Sort
View
DAC
2005
ACM
15 years 7 months ago
Path delay test compaction with process variation tolerance
In this paper we propose a test compaction method for path delay faults in a logic circuit. The method generates a compact set of two-pattern tests for faults on long paths select...
Seiji Kajihara, Masayasu Fukunaga, Xiaoqing Wen, T...
DIALM
2005
ACM
100views Algorithms» more  DIALM 2005»
15 years 7 months ago
On the pitfalls of geographic face routing
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...
ATAL
2007
Springer
15 years 7 months ago
InterPol: a policy framework for managing trust and privacy in referral networks
Referral networks are a kind of P2P system consisting of autonomous agents who seek, provide services, or refer other service providers. Key applications include service discovery...
Yathiraj B. Udupi, Munindar P. Singh
CONCUR
2008
Springer
15 years 7 months ago
Subsequence Invariants
We introduce subsequence invariants, which characterize the behavior of a concurrent system in terms of the occurrences of synchronization events. Unlike state invariants, which re...
Klaus Dräger, Bernd Finkbeiner
CP
2008
Springer
15 years 7 months ago
Exploiting Decomposition in Constraint Optimization Problems
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
Matthew Kitching, Fahiem Bacchus
« Prev « First page 1274 / 1571 Last » Next »