Sciweavers

Share
EC
2010
127views ECommerce» more  EC 2010»
8 years 1 months ago
Representation Invariant Genetic Operators
A genetic algorithm is invariant with respect to a set of representations if it runs the same no matter which of the representations is used. We formalize this concept mathematica...
Jonathan E. Rowe, Michael D. Vose, Alden H. Wright
CEC
2010
IEEE
8 years 2 months ago
EDDIE for investment opportunities forecasting: Extending the search space of the GP
Abstract-- In this paper we present a new version of a GPbased financial forecasting tool called EDDIE. The novelty of this new version (EDDIE 8), is its enlarged search space, whe...
Michael Kampouridis, Edward Tsang
PVLDB
2010
86views more  PVLDB 2010»
8 years 2 months ago
Swarm: Mining Relaxed Temporal Moving Object Clusters
Recent improvements in positioning technology make massive moving object data widely available. One important analysis is to find the moving objects that travel together. Existin...
Zhenhui Li, Bolin Ding, Jiawei Han, Roland Kays
TEC
2002
163views more  TEC 2002»
8 years 3 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
AIEDAM
1998
87views more  AIEDAM 1998»
8 years 4 months ago
Learning to set up numerical optimizations of engineering designs
Gradient-based numerical optimization of complex engineering designs offers the promise of rapidly producing better designs. However, such methods generally assume that the object...
Mark Schwabacher, Thomas Ellman, Haym Hirsh
GPEM
2000
103views more  GPEM 2000»
8 years 4 months ago
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Abstract. Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program s...
William B. Langdon
VC
2008
99views more  VC 2008»
8 years 4 months ago
Minimizing probable collision pairs searched in interactive animation authoring
Animation authoring involves an author's interaction with a scene, resulting in varying scene complexity for a given animation sequence. In such a varying environment, detecti...
Parag Agarwal, Srinivas Rajagopalan, B. Prabhakara...
TIP
2008
219views more  TIP 2008»
8 years 4 months ago
Binary Partition Trees for Object Detection
This paper discusses the use of Binary Partition Trees (BPTs) for object detection. BPTs are hierarchical region-based representations of images. They define a reduced set of regio...
Verónica Vilaplana, Ferran Marqués, ...
ICGA
2007
90views Optimization» more  ICGA 2007»
8 years 4 months ago
Game Over: Black to Play and Draw in Checkers
In 1989, an effort to solve the game of checkers began. It was naïve because of the daunting size of the search space, 5×1020 positions, and because of computer capabilities of ...
Jonathan Schaeffer
FUIN
2007
90views more  FUIN 2007»
8 years 4 months ago
A Resolution Calculus with Shared Literals
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
Nicolas Peltier
books