1142 search results - page 22 / 229 » Set Variables and Local Search |
100
click to vote
VMCAI
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This paper addresses the problem of recovering variable-like entities when analyzing executables in the absence of debugging information. We show that variable-like entit...
147
click to vote
TSMC
2011
14 years 10 months ago
2011
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
126
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
This paper is concerned with a specific brand of evolutionary algorithms: Memetic algorithms. A new local search technique with an adaptive neighborhood setting process is introdu...
108
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
The global search properties of heuristic search algorithms are not well understood. In this paper, we introduce a new metric, mobility, that quantifies the dispersion of local o...
140
click to vote
AUSAI
2003
Springer
15 years 8 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...