4047 search results - page 498 / 810 » The Discrete Basis Problem |
124
click to vote
IWANN
2001
Springer
15 years 9 months ago
2001
Springer
This paper looks upon the standard genetic algorithm as an artificial self-organizing process. With the purpose to provide concepts that make the algorithm more open for scalabili...
144
click to vote
ICML
2000
IEEE
16 years 5 months ago
2000
IEEE
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...
160
Voted
STOC
2010
ACM
15 years 10 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
152
click to vote
SIGGRAPH
2000
ACM
15 years 9 months ago
2000
ACM
The traditional high-level algorithms for rigid body simulation work well for moderate numbers of bodies but scale poorly to systems of hundreds or more moving, interacting bodies...
179
Voted
COLT
1993
Springer
15 years 9 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...