Sciweavers

3820 search results - page 615 / 764
» Bounded Model Debugging
Sort
View
126
Voted
ICDCS
2009
IEEE
15 years 11 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
111
Voted
ICCAD
2006
IEEE
125views Hardware» more  ICCAD 2006»
15 years 11 months ago
Leveraging protocol knowledge in slack matching
Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, t...
Girish Venkataramani, Seth Copen Goldstein
ICCAD
2003
IEEE
154views Hardware» more  ICCAD 2003»
15 years 11 months ago
Length-Matching Routing for High-Speed Printed Circuit Boards
As the clock frequencies used in industrial applications increase, the timing requirements imposed on routing problems become tighter. So, it becomes important to route the nets w...
Muhammet Mustafa Ozdal, Martin D. F. Wong
110
Voted
SOFSEM
2010
Springer
15 years 11 months ago
Fast Arc-Annotated Subsequence Matching in Linear Space
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
Philip Bille, Inge Li Gørtz
145
Voted
HICSS
2010
IEEE
240views Biometrics» more  HICSS 2010»
15 years 9 months ago
Can e-Government Adopters Benefit from a Technology-First Approach? The Case of Egypt Embarking on Service-Oriented Architecture
It seems common sense that “policy matters” in setting up e-government interoperability, mainly because collaboration should be guided by dedicated integration objectives and ...
Ralf Klischewski, Ranwa Abubakr