Sciweavers

945 search results - page 109 / 189
» Incremental Branching Programs
Sort
View
GECCO
2009
Springer
163views Optimization» more  GECCO 2009»
14 years 3 months ago
Dealing with inheritance in OO evolutionary testing
Most of the software developed in the world follows the object-oriented (OO) paradigm. However, the existing work on evolutionary testing is mainly targeted to procedural language...
Javier Ferrer, J. Francisco Chicano, Enrique Alba
MICRO
1998
IEEE
139views Hardware» more  MICRO 1998»
14 years 1 months ago
Better Global Scheduling Using Path Profiles
Path profiles record the frequencies of execution paths through a program. Until now, the best global instruction schedulers have relied upon profile-gathered frequencies of condi...
Cliff Young, Michael D. Smith
NIPS
1993
13 years 10 months ago
Temporal Difference Learning of Position Evaluation in the Game of Go
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...
Nicol N. Schraudolph, Peter Dayan, Terrence J. Sej...
DLS
2009
179views Languages» more  DLS 2009»
13 years 6 months ago
Directing JavaScript with arrows
JavaScript programmers make extensive use of event-driven programming to help build responsive web applications. However, standard approaches to sequencing events are messy, and o...
Yit Phang Khoo, Michael Hicks, Jeffrey S. Foster, ...
IWMM
2004
Springer
82views Hardware» more  IWMM 2004»
14 years 2 months ago
Write barrier elision for concurrent garbage collectors
Concurrent garbage collectors require write barriers to preserve consistency, but these barriers impose significant direct and indirect costs. While there has been a lot of work ...
Martin T. Vechev, David F. Bacon