2434 search results - page 79 / 487 » Algorithmic Randomness of Closed Sets |
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
In context-aware route planning, a set of agents has to plan routes on a common infrastructure and each agent has to plan a conflict-free route from a source to a destination wit...
120
Voted
EUSFLAT
2007
15 years 4 months ago
2007
Heuristic search for the global minimum is studied. This paper is focused on the adaptation of control parameters in differential evolution (DE) and in controlled random search (...
163
click to vote
ICIP
2003
IEEE
16 years 5 months ago
2003
IEEE
Curvature flows have been extensively considered from a deterministic point of view. They have been shown to be useful for a number of applications including crystal growth, flame...
117
Voted
CSDA
2006
15 years 3 months ago
2006
Methods for imputation of missing data in the so-called least-squares approximation approach, a non-parametric computationally efficient multidimensional technique, are experiment...
119
Voted
JMIV
2002
15 years 3 months ago
2002
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...