Sciweavers

1244 search results - page 98 / 249
» Searching in Higher Dimension
Sort
View
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
14 years 1 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley
SIGIR
2012
ACM
12 years 14 days ago
An exploration of ranking heuristics in mobile local search
Users increasingly rely on their mobile devices to search local entities, typically businesses, while on the go. Even though recent work has recognized that the ranking signals in...
Yuanhua Lv, Dimitrios Lymberopoulos, Qiang Wu
AAAI
2008
14 years 11 days ago
Anytime Local Search for Distributed Constraint Optimization
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...
Roie Zivan
GECCO
2005
Springer
14 years 3 months ago
Probabilistic distribution models for EDA-based GP
This paper proposes a novel technique for a program evolution based on probabilistic models. In the proposed method, two probabilistic distribution models with probabilistic depen...
Kohsuke Yanai, Hitoshi Iba
ICPP
2005
IEEE
14 years 3 months ago
A Hybrid Searching Scheme in Unstructured P2P Networks
The existing searching schemes in Peer-to-Peer (P2P) networks are either forwarding-based or non-forwarding based. In forwarding-based schemes, queries are forwarded from the quer...
Xiuqi Li, Jie Wu