Sciweavers

2834 search results - page 113 / 567
» Representing Trees with Constraints
Sort
View
DAGSTUHL
2003
13 years 11 months ago
Genetic Design: Amplifying Our Ability to Deal With Requirements Complexity
Individual functional requirements represent fragments of behavior, while a design that satisfies a set of functional requirements represents integrated behavior. This perspective ...
R. Geoff Dromey
CAV
2004
Springer
152views Hardware» more  CAV 2004»
14 years 3 months ago
Abstract Regular Model Checking
Regular Tree Model Checking Ahmed Bouajjani, Peter Habermehl 1 LIAFA, University Paris 7, Case 7014, 2, place Jussieu, F-75251 Paris Cedex 05, France Adam Rogalewicz, Tom´aˇs Voj...
Ahmed Bouajjani, Peter Habermehl, Tomás Voj...
FSTTCS
2007
Springer
14 years 4 months ago
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b  2. The aim is to nd a minimum weight spannin...
Anand Srivastav, Sören Werth
ICCAD
1998
IEEE
105views Hardware» more  ICCAD 1998»
14 years 2 months ago
Fanout optimization under a submicron transistor-level delay model
In this paper we present a new fanout optimization algorithm which is particularly suitable for digital circuits designed with submicron CMOS technologies. Restricting the class o...
Pasquale Cocchini, Massoud Pedram, Gianluca Piccin...
VLDB
2002
ACM
133views Database» more  VLDB 2002»
14 years 10 months ago
Tree pattern query minimization
: Purpose ? Tree pattern is at the core of XML queries. The tree patterns in XML queries typically contain redundancies, especially when broad integrity constraints (ICs) are prese...
Sihem Amer-Yahia, SungRan Cho, Laks V. S. Lakshman...