2080 search results - page 230 / 416 » Measuring empirical computational complexity |
139
click to vote
EDBTW
2010
Springer
16 years 23 days ago
2010
Springer
To face the increasing demand from users, National Statistical Institutes (NSI) release different information products. The dissemination of this information should be performed ...
164
click to vote
IPSN
2009
Springer
16 years 21 days ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
154
click to vote
EUROGP
2009
Springer
16 years 15 days ago
2009
Springer
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
154
click to vote
GECCO
2009
Springer
16 years 15 days ago
2009
Springer
Helicopter hovering is an important challenge problem in the field of reinforcement learning. This paper considers several neuroevolutionary approaches to discovering robust cont...
173
click to vote
PKDD
2009
Springer
16 years 14 days ago
2009
Springer
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...