3946 search results - page 652 / 790 » The computational complexity of choice sets |
162
click to vote
EUROGP
2009
Springer
16 years 1 months 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...
171
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
176
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...
187
click to vote
PKDD
2009
Springer
16 years 1 months 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...
171
click to vote
MOBILWARE
2009
ACM
16 years 1 months ago
2009
ACM
The availability of heterogeneous wireless interfaces and of growing computing resources on widespread portable devices pushes for enabling innovative deployment scenarios where mo...