Sciweavers

1312 search results - page 196 / 263
» Formally Optimal Boxing
Sort
View
FMSB
2008
199views Formal Methods» more  FMSB 2008»
13 years 11 months ago
Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions
We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds ...
Jasmin Fisher, Thomas A. Henzinger, Maria Mateescu...
AI
2008
Springer
13 years 10 months ago
Expressive probabilistic description logics
The work in this paper is directed towards sophisticated formalisms for reasoning under probabilistic uncertainty in ontologies in the Semantic Web. Ontologies play a central role...
Thomas Lukasiewicz
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 10 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
ICDT
2012
ACM
235views Database» more  ICDT 2012»
12 years 18 days ago
Equivalence and minimization of conjunctive queries under combined semantics
The problems of query containment, equivalence, and minimization are recognized as very important in the context of query processing, specifically of query optimization. In their...
Rada Chirkova
TKDE
2012
487views Formal Methods» more  TKDE 2012»
12 years 17 days ago
Query Planning for Continuous Aggregation Queries over a Network of Data Aggregators
—Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of som...
Rajeev Gupta, Krithi Ramamritham