Sciweavers

275 search results - page 8 / 55
» A compact data structure for representing a dynamic multiset
Sort
View
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
14 years 20 days ago
Structural and Functional Sequence Test of Dynamic and State-Based Software with Evolutionary Algorithms
Evolutionary Testing (ET) has been shown to be very successful for testing real world applications [10]. The original ET approach focusesonsearching for a high coverage of the test...
André Baresel, Hartmut Pohlheim, Sadegh Sad...
ICDE
2007
IEEE
190views Database» more  ICDE 2007»
13 years 11 months ago
CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
Swee-Seong Wong, Wing-Kin Sung, Limsoon Wong
APWEB
2004
Springer
14 years 26 days ago
Labeling and Querying Dynamic XML Trees
Abstract With the growing importance of XML in data exchange, much research tends to provide a compact labeling scheme and a flexible query facility to extract data from dynamic XM...
Jiaheng Lu, Tok Wang Ling
AAAI
1998
13 years 8 months ago
Structured Representation of Complex Stochastic Systems
This paperconsidersthe problem of representingcomplex systems that evolve stochastically over time. Dynamic Bayesian networks provide a compact representation for stochastic proce...
Nir Friedman, Daphne Koller, Avi Pfeffer
CORR
2004
Springer
125views Education» more  CORR 2004»
13 years 7 months ago
High-Level Networking With Mobile Code And First Order AND-Continuations
We describe a scheme for moving living code between a set of distributed processes coordinated with unification based Linda operations, and its application to building a comprehen...
Paul Tarau, Verónica Dahl