Sciweavers

845 search results - page 14 / 169
» Complexity Dimensions and Learnability
Sort
View
ICNC
2005
Springer
14 years 26 days ago
On Evolutionary Optimization of Large Problems Using Small Populations
Abstract. Small populations are very desirable for reducing the required computational resources in evolutionary optimization of complex real-world problems. Unfortunately, the sea...
Yaochu Jin, Markus Olhofer, Bernhard Sendhoff
JSAI
2001
Springer
13 years 11 months ago
Complexity of Agents and Complexity of Markets
In this study we rethought efficient market hypothesis from a viewpoint of complexity of market participants’ prediction methods and market price’s dynamics, and examined the ...
Kiyoshi Izumi
COMPGEOM
2004
ACM
14 years 23 days ago
On lines avoiding unit balls in three dimensions
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, M...
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
14 years 22 days ago
Dimension, Entropy Rates, and Compression
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
John M. Hitchcock, N. V. Vinodchandran
GD
2005
Springer
14 years 26 days ago
MultiPlane: A New Framework for Drawing Graphs in Three Dimensions
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
Seok-Hee Hong