Sciweavers

756 search results - page 18 / 152
» A new algorithm for Boolean operations on general polygons
Sort
View
GECCO
2006
Springer
121views Optimization» more  GECCO 2006»
15 years 8 months ago
A splicing/decomposable encoding and its novel operators for genetic algorithms
In this paper, we introduce a new genetic representation -- a splicing/decomposable (S/D) binary encoding, which was proposed based on some theoretical guidance and existing recom...
Yong Liang, Kwong-Sak Leung, Kin-Hong Lee
VMCAI
2004
Springer
15 years 9 months ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
PPSN
2010
Springer
15 years 2 months ago
General Lower Bounds for the Running Time of Evolutionary Algorithms
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
Dirk Sudholt
SI3D
1992
ACM
15 years 8 months ago
Interactive Volume Rendering on a Multicomputer
Direct volume rendering is a computationally intensive operation that has become a valued and often preferred visualization tool. For maximal data comprehension, interactive manip...
Ulrich Neumann
AAAI
2008
15 years 6 months ago
Studies in Solution Sampling
We introduce novel algorithms for generating random solutions from a uniform distribution over the solutions of a boolean satisfiability problem. Our algorithms operate in two pha...
Vibhav Gogate, Rina Dechter