6149 search results - page 334 / 1230 » Revealing the programming process |
187
click to vote
GECCO
2005
Springer
16 years 8 days ago
2005
Springer
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
174
Voted
PATAT
2004
Springer
16 years 3 days ago
2004
Springer
Timetabling problems have been frequently studied due to their wide range of applications. However, they are often solved manually because of the lack of appropriate computer tools...
166
click to vote
ICPPW
2003
IEEE
16 years 21 hour ago
2003
IEEE
Recent work in high-performance computing has shifted attention to PC clusters.. For PC-clusters, member nodes are independent computers connected by generalpurpose networks. The ...
165
click to vote
NIPS
2007
15 years 8 months ago
2007
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
161
Voted
CSC
2006
15 years 8 months ago
2006
: This work is about an algorithm for solving a linear program which is simple to apply. There are three algorithms in this work. The first algorithm solves a two-variable linear p...