2905 search results - page 355 / 581 » Formal Memetic Algorithms |
136
Voted
IPSN
2009
Springer
15 years 10 months 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...
123
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Reasoning about others, as performed by agents in order to coordinate their behaviours with those of others, commonly involves forming and updating beliefs about hidden system pro...
110
click to vote
RECSYS
2009
ACM
15 years 10 months ago
2009
ACM
We examine the case of over-specialization in recommender systems, which results from returning items that are too similar to those previously rated by the user. We propose Outsid...
134
Voted
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— We recast the problem of unconstrained continuous evolutionary optimization as inference in a fixed graphical model. This approach allows us to address several pervasi...
124
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...