Sciweavers

602 search results - page 56 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
INFSOF
2008
85views more  INFSOF 2008»
14 years 9 months ago
Locating dependence structures using search-based slicing
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
Tao Jiang, Nicolas Gold, Mark Harman, Zheng Li
GECCO
2003
Springer
15 years 2 months ago
On Role of Implicit Interaction and Explicit Communications in Emergence of Social Behavior in Continuous Predators-Prey Pursuit
We present the result of our work on use of genetic programming for evolving social behavior of agents situated in inherently cooperative environment. We use predators-prey pursuit...
Ivan Tanev, Katsunori Shimohara
SPEECH
2010
154views more  SPEECH 2010»
14 years 4 months ago
Long story short - Global unsupervised models for keyphrase based meeting summarization
act 11 We analyze and compare two different methods for unsupervised extractive spontaneous speech summarization in the meeting 12 domain. Based on utterance comparison, we introdu...
Korbinian Riedhammer, Benoît Favre, Dilek Ha...
104
Voted
EUROGP
2007
Springer
144views Optimization» more  EUROGP 2007»
15 years 3 months ago
Fitness Landscape Analysis and Image Filter Evolution Using Functional-Level CGP
This work analyzes fitness landscapes for the image filter design problem approached using functional-level Cartesian Genetic Programming. Smoothness and ruggedness of fitness l...
Karel Slaný, Lukás Sekanina
COR
2010
123views more  COR 2010»
14 years 9 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...