Sciweavers

182 search results - page 16 / 37
» Some problems with the notion of context-aware computing
Sort
View
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
13 years 8 months ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...
PPSN
1998
Springer
13 years 11 months ago
Modeling Building-Block Interdependency
The Building-Block Hypothesis appeals to the notion of problem decomposition and the assembly of solutions from sub-solutions. Accordingly, there have been many varieties of GA tes...
Richard A. Watson, Gregory Hornby, Jordan B. Polla...
ACRI
2010
Springer
13 years 6 months ago
The Complexity of Three-Dimensional Critical Avalanches
In this work we study the complexity of the three-dimensional sandpile avalanches triggered by the addition of two critical configurations. We prove that the algorithmic problem c...
Carolina Mejía, J. Andrés Montoya
ICLP
2003
Springer
14 years 22 days ago
Uniform Equivalence of Logic Programs under the Stable Model Semantics
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
Thomas Eiter, Michael Fink
STACS
2009
Springer
14 years 2 months ago
Approximating Acyclicity Parameters of Sparse Hypergraphs
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...