Sciweavers

552 search results - page 82 / 111
» On the Complexity of Join Predicates
Sort
View
ISSTA
2010
ACM
13 years 9 months ago
Analysis of invariants for efficient bounded verification
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
Juan P. Galeotti, Nicolás Rosner, Carlos L&...
DILS
2007
Springer
13 years 9 months ago
A High-Throughput Bioinformatics Platform for Mass Spectrometry-Based Proteomics
The success of mass spectrometry-based proteomics in emerging applications such as biomarker discovery and clinical diagnostics, is predicated substantially on its ability to achie...
Thodoros Topaloglou, Moyez Dharsee, Rob M. Ewing, ...
AAAI
2006
13 years 9 months ago
Learning Partially Observable Action Schemas
We present an algorithm that derives actions' effects and preconditions in partially observable, relational domains. Our algorithm has two unique features: an expressive rela...
Dafna Shahaf, Eyal Amir
CIDR
2003
123views Algorithms» more  CIDR 2003»
13 years 9 months ago
Managing Expressions as Data in Relational Database Systems
A wide-range of applications, including Publish/Subscribe, Workflow, and Web-site Personalization, require maintaining user’s interest in expected data as conditional expression...
Aravind Yalamanchi, Jagannathan Srinivasan, Dieter...
BIRTHDAY
2010
Springer
13 years 8 months ago
Halting and Equivalence of Program Schemes in Models of Arbitrary Theories
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
Dexter Kozen