1494 search results - page 15 / 299 » Less Extreme Programming |
NIPS
1993
15 years 1 months ago
1993
The game of Go has a high branching factor that defeats the tree search approach used in computer chess, and long-range spatiotemporal interactions that make position evaluation e...
IOR
2010
14 years 9 months ago
2010
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
218
click to vote
CP
2009
Springer
16 years 10 days ago
2009
Springer
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
ECOOP
2008
Springer
15 years 1 months ago
2008
Springer
Back-in-time debuggers are extremely useful tools for identifying the causes of bugs. Unfortunately the "omniscient" approaches that try to remember all previous states a...
119
click to vote
CASES
2006
ACM
15 years 5 months ago
2006
ACM
Developing an optimizing compiler for a newly proposed architecture is extremely difficult when there is only a simulator of the machine available. Designing such a compiler requ...