Sciweavers

53 search results - page 7 / 11
» Fully-Functional Succinct Trees
Sort
View
CAV
1999
Springer
104views Hardware» more  CAV 1999»
15 years 1 months ago
On the Representation of Probabilities over Structured Domains
Abstract. In this paper we extend one of the main tools used in veri cation of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. W...
Marius Bozga, Oded Maler
CORR
2007
Springer
78views Education» more  CORR 2007»
14 years 9 months ago
Hybrid Branching-Time Logics
We introduce hybrid branching-time logics as extensions of CT L-like logics with hybrid machinery such as the downarrow-operator. Following recent work in the linear framework, we...
Volker Weber
TSMC
2002
125views more  TSMC 2002»
14 years 9 months ago
Dynamic page based crossover in linear genetic programming
Page-based Linear Genetic Programming (GP) is proposed in which individuals are described in terms of a number of pages. Pages are expressed in terms of a fixed number of instructi...
Malcolm I. Heywood, A. Nur Zincir-Heywood
CPM
2005
Springer
109views Combinatorics» more  CPM 2005»
15 years 3 months ago
Using PQ Trees for Comparative Genomics
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a maximal permutation pattern was introduced in [12]....
Gad M. Landau, Laxmi Parida, Oren Weimann
SIGGRAPH
1995
ACM
15 years 1 months ago
Creation and rendering of realistic trees
Recent advances in computer graphics have produced images approaching the elusive goal of photorealism. Since many natural objects are so complex and detailed, they are often not ...
Jason Weber, Joseph Penn