975 search results - page 21 / 195 » Locality Optimization for Program Instances |
GECCO
2000
Springer
15 years 1 months ago
2000
Springer
This paper presents an extension to genetic programming to allow the evolution of programs containing local variables with static scope which obey the invariant that all variables...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
73
Voted
ICS
2005
Tsinghua U.
15 years 3 months ago
2005
Tsinghua U.
A key step in program optimization is the determination of optimal values for code optimization parameters such as cache tile sizes and loop unrolling factors. One approach, which...
CADE
1998
Springer
15 years 1 months ago
1998
Springer
The CRIL multi-strategy platform for SAT includes a whole family of local search techniques and some of the best Davis and Putnam strategies for checking propositional satis abilit...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we present semidefinite programming (SDP) gap instances for the following variants of the Label-Cover problem, closely related to the Unique Games Conjecture: (i) 2-...