Sciweavers

3825 search results - page 513 / 765
» More on pooling spaces
Sort
View
SAT
2007
Springer
181views Hardware» more  SAT 2007»
16 years 1 months ago
Breaking Symmetries in SAT Matrix Models
Abstract. Symmetry occurs naturally in many computational problems. The use of symmetry breaking techniques for solving search problems reduces the search space and therefore is ex...
Inês Lynce, João P. Marques Silva
SCALESPACE
2007
Springer
16 years 1 months ago
Towards Segmentation Based on a Shape Prior Manifold
Incorporating shape priors in image segmentation has become a key problem in computer vision. Most existing work is limited to a linearized shape space with small deformation modes...
Patrick Etyngier, Renaud Keriven, Jean-Philippe Po...
TACAS
2007
Springer
92views Algorithms» more  TACAS 2007»
16 years 1 months ago
Model Checking Liveness Properties of Genetic Regulatory Networks
Abstract. Recent studies have demonstrated the possibility to build genetic regulatory networks that confer a desired behavior to a living organism. However, the design of these ne...
Grégory Batt, Calin Belta, Ron Weiss
VAMOS
2007
Springer
16 years 1 months ago
Exploring the Dimensions of Variability: a Requirements Engineering Perspective
Goal models have been found to be effective for representing and analyzing variability at the early requirements level, by comprehensibly representing all alternative ways by whic...
Sotirios Liaskos, Lei Jiang, Alexei Lapouchnian, Y...
WEA
2007
Springer
117views Algorithms» more  WEA 2007»
16 years 1 months ago
Better Landmarks Within Reach
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F....