Sciweavers

2834 search results - page 24 / 567
» Representing Trees with Constraints
Sort
View
CONSTRAINTS
2008
95views more  CONSTRAINTS 2008»
13 years 9 months ago
Efficient Sequence Alignment with Side-Constraints by Cluster Tree Elimination
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
Sebastian Will, Anke Busch, Rolf Backofen
ENTCS
2008
150views more  ENTCS 2008»
13 years 9 months ago
Analyzing Security Scenarios Using Defence Trees and Answer Set Programming
Defence trees are used to represent attack and defence strategies in security scenarios; the aim in such scenarios is to select the best set of countermeasures that are able to st...
Stefano Bistarelli, Pamela Peretti, Irina Trubitsy...
CAV
2009
Springer
134views Hardware» more  CAV 2009»
14 years 9 months ago
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Abstract. Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and process creation. The goal of this paper is to develop generic techniqu...
Alexander Wenner, Markus Müller-Olm, Peter La...
CPAIOR
2007
Springer
14 years 3 months ago
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal
CGI
2003
IEEE
14 years 14 days ago
Reaching Volumes Generated by Means of Octal Trees and Cartesian Constraints
This paper presents a system to analyze the reachability of the human body. The inverse kinematics technique is employed to find which regions of space are reachable using a certa...
I. Rodríguez, Manuel Peinado, Ronan Boulic,...