244 search results - page 13 / 49 » A Linear Search Strategy using Bounds |
ATAL
2006
Springer
14 years 11 days ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
Clustering-based approaches for abnormal video event detection have been proven to be effective in the recent literature. Based on the framework proposed in our previous work [1],...
CP
2003
Springer
14 years 1 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
GECCO
2011
Springer
13 years 3 days ago
2011
Springer
When the epistasis of the fitness function is bounded by a constant, we show that the expected fitness of an offspring of the (1+1)-EA can be efficiently computed for any point...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
Recently, a form of memory usage was introduced for genetic programming (GP) called “soft memory.” Rather than have a new value completely overwrite the old value in a registe...