3946 search results - page 557 / 790 » The computational complexity of choice sets |
178
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
— Computational complexity is a major challenge in evolutionary algorithms due to their need for repeated fitness function evaluations. Here, we aim to reduce number of fitness f...
207
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
180
click to vote
CCCG
2007
15 years 8 months ago
2007
Given a set P of n points in R2 , we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersect...
191
click to vote
NIPS
2007
15 years 8 months ago
2007
We investigate the problem of learning a widely-used latent-variable model – the Latent Dirichlet Allocation (LDA) or “topic” model – using distributed computation, where ...
212
click to vote
ADHOCNOW
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. This paper investigates the challenges involve in designing a dynamic channel assignment (DCA) scheme for wireless mesh networks, particularly for multi-radio systems. It...