Sciweavers

654 search results - page 79 / 131
» Ordered Sets and Complete Lattices
Sort
View
IRI
2009
IEEE
14 years 2 months ago
OntoMatch: A Monotonically Improving Schema Matching System for Autonomous Data Integration
Traditional schema matchers use a set of distinct simple matchers and use a composition function to combine the individual scores using an arbitrary order of matcher application l...
Anupam Bhattacharjee, Hasan M. Jamil
FATES
2005
Springer
14 years 1 months ago
Testing Systems of Concurrent Black-Boxes-An Automata-Theoretic and Decompositional Approach
The global testing problem studied in this paper is to seek a definite answer to whether a system of concurrent black-boxes has an observable behavior in a given finite (but cou...
Gaoyan Xie, Zhe Dang
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
13 years 11 months ago
Finding Mobile Data: Efficiency vs. Location Inaccuracy
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
Amotz Bar-Noy, Joanna Klukowska
CASCON
2008
111views Education» more  CASCON 2008»
13 years 9 months ago
DBMS workload control using throttling: experimental insights
Today's database management systems (DBMSs) are required to handle diverse, mixed workloads and to provide differentiated levels of service to ensure that critical work takes...
Wendy Powley, Patrick Martin, Paul Bird
AAAI
2006
13 years 9 months ago
Approximate Compilation for Embedded Model-based Reasoning
The use of embedded technology has become widespread. Many complex engineered systems comprise embedded features to perform self-diagnosis or self-reconfiguration. These features ...
Barry O'Sullivan, Gregory M. Provan