Sciweavers

2584 search results - page 429 / 517
» On the Forward Checking Algorithm
Sort
View
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
15 years 10 months ago
Efficient Query Reformulation in Peer-Data Management Systems
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
Igor Tatarinov, Alon Y. Halevy
SIGMOD
2003
ACM
150views Database» more  SIGMOD 2003»
15 years 10 months ago
Capturing both Types and Constraints in Data Integration
We propose a framework for integrating data from multiple relational sources into an XML document that both conforms to a given DTD and satisfies predefined XML constraints. The f...
Michael Benedikt, Chee Yong Chan, Wenfei Fan, Juli...
ICFP
2004
ACM
15 years 9 months ago
Searching for deadlocks while debugging concurrent haskell programs
This paper presents an approach to searching for deadlocks in Concurrent Haskell programs. The search is based on a redefinition of the IO monad which allows the reversal of Concu...
Jan Christiansen, Frank Huch
ICCAD
2006
IEEE
124views Hardware» more  ICCAD 2006»
15 years 6 months ago
A linear-time approach for static timing analysis covering all process corners
Abstract—Manufacturing process variations lead to circuit timing variability and a corresponding timing yield loss. Traditional corner analysis consists of checking all process c...
Sari Onaissi, Farid N. Najm
ICCAD
2005
IEEE
90views Hardware» more  ICCAD 2005»
15 years 6 months ago
Scalable compositional minimization via static analysis
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
Fadi A. Zaraket, Jason Baumgartner, Adnan Aziz