Sciweavers

5084 search results - page 400 / 1017
» Proving Possibility Properties
Sort
View
AAAI
1992
15 years 8 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek
ECAI
2010
Springer
15 years 8 months ago
Constraint-Based Controller Synthesis in Non-Deterministic and Partially Observable Domains
Controller synthesis consists in automatically building controllers taking as inputs observation data and returning outputs guaranteeing that the controlled system satisfies some d...
Cédric Pralet, Gérard Verfaillie, Mi...
FMICS
2010
Springer
15 years 7 months ago
Correctness of Sensor Network Applications by Software Bounded Model Checking
We investigate the application of the software bounded model checking tool CBMC to the domain of wireless sensor networks (WSNs). We automatically generate a software behavior mode...
Frank Werner, David Faragó
ENDM
2008
142views more  ENDM 2008»
15 years 6 months ago
Augmenting the Connectivity of Planar and Geometric Graphs
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
Ignaz Rutter, Alexander Wolff
172
Voted
PPL
2006
93views more  PPL 2006»
15 years 6 months ago
Inherently Parallel Geometric Computations
A new computational paradigm is described which o ers the possibility of superlinear and sometimes unbounded speedup, when parallel computation is used. The computations involved ...
Selim G. Akl