Sciweavers

569 search results - page 30 / 114
» An Empirical Study of Structural Constraint Solving Techniqu...
Sort
View
FCSC
2007
131views more  FCSC 2007»
15 years 1 months ago
SONNET: subscription using path queries over structured overlay networks
Application-level content-based routing using XML is a key technology for decentralized publish/subscribe systems. In this paper, a new approach is proposed to support the efficien...
Weining Qian, Linhao Xu, Aoying Zhou, Minqi Zhou
PVLDB
2010
119views more  PVLDB 2010»
15 years 11 days ago
Chase Termination: A Constraints Rewriting Approach
Several database areas such as data exchange and integration share the problem of fixing database instance violations with respect to a set of constraints. The chase algorithm so...
Francesca Spezzano, Sergio Greco
CP
2007
Springer
15 years 5 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
WCRE
2000
IEEE
15 years 6 months ago
A Structured Demonstration of Program Comprehension Tools
This paper describes a structured tool demonstration, a hybrid evaluation technique that combines elements from experiments, case studies, and technology demonstrations. Developer...
Susan Elliott Sim, Margaret-Anne D. Storey
PASTE
2004
ACM
15 years 7 months ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick