244 search results - page 7 / 49 » A Linear Search Strategy using Bounds |
ECCV
2004
Springer
14 years 10 months ago
2004
Springer
Abstract. A dynamic visual search framework based mainly on innerscene similarity is proposed. Algorithms as well as measures quantifying the difficulty of search tasks are suggest...
ANOR
2011
13 years 8 days ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
ML
1998
ACM
13 years 8 months ago
1998
ACM
We use simulated soccer to study multiagent learning. Each team's players (agents) share action set and policy, but may behave di erently due to position-dependent inputs. All...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Recent results show that the Differential Evolution algorithm has significant difficulty on functions that are not linearly separable. On such functions, the algorithm must rely...
KI
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...