Sciweavers

503 search results - page 88 / 101
» The O2 Database Programming Language
Sort
View
ICALP
2007
Springer
14 years 3 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
COOTS
1997
13 years 10 months ago
MiSFIT: A Tool for Constructing Safe Extensible C++ Systems
The boundary between application and system is becoming increasingly permeable. Extensible applications, such as web browsers, database systems, and operating systems, demonstrate...
Christopher Small
COLING
2002
13 years 8 months ago
Creating a Finite-State Parser with Application Semantics
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexi...
PODS
2006
ACM
156views Database» more  PODS 2006»
14 years 9 months ago
From statistical knowledge bases to degrees of belief: an overview
An intelligent agent will often be uncertain about various properties of its environment, and when acting in that environment it will frequently need to quantify its uncertainty. ...
Joseph Y. Halpern
ESE
2006
154views Database» more  ESE 2006»
13 years 8 months ago
Prioritizing JUnit Test Cases: An Empirical Assessment and Cost-Benefits Analysis
Test case prioritization provides a way to run test cases with the highest priority earliest. Numerous empirical studies have shown that prioritization can improve a test suite�...
Hyunsook Do, Gregg Rothermel, Alex Kinneer