Sciweavers

4128 search results - page 678 / 826
» Learning and using relational theories
Sort
View
63
Voted
TEC
2002
88views more  TEC 2002»
14 years 9 months ago
Parallelism and evolutionary algorithms
Abstract--This paper contains a modern vision of the parallelization techniques used for evolutionary algorithms (EAs). The work is motivated by two fundamental facts: first, the d...
Enrique Alba, Marco Tomassini
DM
2008
77views more  DM 2008»
14 years 8 months ago
Perfect Skolem sets
A Skolem sequence is a sequence s1, s2, . . . , s2n (where si A = {1 . . . n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apar...
Gustav Nordh
121
Voted
IDEAS
2010
IEEE
238views Database» more  IDEAS 2010»
14 years 8 months ago
An integrative approach to query optimization in native XML database management systems
Even though an effective cost-based query optimizer is of utmost importance for the efficient evaluation of XQuery expressions in native XML database systems, such a component is...
Andreas M. Weiner, Theo Härder
99
Voted
LATA
2010
Springer
14 years 8 months ago
Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we conside...
Fernando Rosa Velardo, Giorgio Delzanno
RSA
2010
98views more  RSA 2010»
14 years 8 months ago
Merging percolation on Zd and classical random graphs: Phase transition
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
Tatyana S. Turova, Thomas Vallier