Sciweavers

746 search results - page 24 / 150
» Short Term Unit-Commitment Using Genetic Algorithms
Sort
View
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
14 years 1 months ago
Improving the human readability of features constructed by genetic programming
The use of machine learning techniques to automatically analyse data for information is becoming increasingly widespread. In this paper we examine the use of Genetic Programming a...
Matthew Smith, Larry Bull
WWW
2009
ACM
14 years 8 months ago
Rated aspect summarization of short comments
Web 2.0 technologies have enabled more and more people to freely comment on different kinds of entities (e.g. sellers, products, services). The large scale of information poses th...
Yue Lu, ChengXiang Zhai, Neel Sundaresan
GECCO
2007
Springer
207views Optimization» more  GECCO 2007»
14 years 1 months ago
A data parallel approach to genetic programming using programmable graphics hardware
In recent years the computing power of graphics cards has increased significantly. Indeed, the growth in the computing power of these graphics cards is now several orders of magn...
Darren M. Chitty
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
14 years 1 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
14 years 2 days ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson