Sciweavers

988 search results - page 124 / 198
» Pseudo-Genetic Algorithmic Composition
Sort
View
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 4 months ago
Indirect co-evolution for understanding belief in an incomplete information dynamic game
This study aims to design a new co-evolution algorithm, Mixture Co-evolution which enables modeling of integration and composition of direct co-evolution and indirect coevolution....
Nanlin Jin
90
Voted
VIS
2004
IEEE
134views Visualization» more  VIS 2004»
16 years 1 months ago
Projecting Tetrahedra without Rendering Artifacts
Hardware-accelerated direct volume rendering of unstructured volumetric meshes is often based on tetrahedral cell projection, in particular, the Projected Tetrahedra (PT) algorith...
David S. Ebert, Martin Kraus, Wei Qiao
CONCUR
2009
Springer
15 years 7 months ago
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...
146
Voted
PE
2010
Springer
138views Optimization» more  PE 2010»
14 years 11 months ago
Trace data characterization and fitting for Markov modeling
We propose a trace fitting algorithm for Markovian Arrival Processes (MAPs) that can capture statistics of any order of interarrival times between measured events. By studying re...
Giuliano Casale, Eddy Z. Zhang, Evgenia Smirni
90
Voted
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 4 months ago
gLINC: identifying composability using group perturbation
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
David Jonathan Coffin, Christopher D. Clack