Sciweavers

4553 search results - page 292 / 911
» Distributed Ranked Search
Sort
View
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
16 years 13 days ago
PolyEDA: Combining Estimation of Distribution Algorithms and Linear Inequality Constraints
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
Jörn Grahl, Franz Rothlauf
IEEECIT
2010
IEEE
15 years 5 months ago
Selective and Early Threat Detection in Large Networked Systems
—The complexity of modern networked information systems, as well as all the defense-in-depth best practices, require distributed intrusion detection architectures relying on the ...
Michele Colajanni, Mirco Marchetti, Michele Messor...
ATAL
2004
Springer
16 years 14 days ago
Time-Variant Distributed Agent Matching Applications
The process of pair partnership formation is an important infrastructure for many plausible MAS applications. Each agent evaluates potential partner agents, where each potential m...
David Sarne, Sarit Kraus
NIPS
2003
15 years 8 months ago
Policy Search by Dynamic Programming
We consider the policy search approach to reinforcement learning. We show that if a “baseline distribution” is given (indicating roughly how often we expect a good policy to v...
J. Andrew Bagnell, Sham Kakade, Andrew Y. Ng, Jeff...
SIGCOMM
2009
ACM
16 years 1 months ago
SMS-based contextual web search
SMS-based web search is different from traditional web search in that the final response to a search query is limited to a very small number of bytes (typically 1-2 SMS messages...
Jay Chen, Brendan Linn, Lakshminarayanan Subramani...