1763 search results - page 74 / 353 » A Formalization of Polytime Functions |
PVLDB
2010
14 years 8 months ago
2010
The recent literature has provided a solid theoretical foundation for the use of schema mappings in data-exchange applications. Following this formalization, new algorithms have b...
ICMLA
2009
14 years 7 months ago
2009
In sequential decision making under uncertainty, as in many other modeling endeavors, researchers observe a dynamical system and collect data measuring its behavior over time. The...
DAC
2003
ACM
15 years 10 months ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
AMAST
2000
Springer
15 years 2 months ago
2000
Springer
Default reasoning has become an important topic in software engineering. In particular, defaults can be used to revise speci cations, to enhance reusability of existing systems, an...
ML
2007
ACM
14 years 9 months ago
2007
ACM
In many learning problems prior knowledge about pattern variations can be formalized and beneficially incorporated into the analysis system. The corresponding notion of invarianc...