Sciweavers

169 search results - page 9 / 34
» Decentralized Search with Random Costs
Sort
View
AAAI
1996
13 years 8 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
HIPC
2007
Springer
14 years 26 days ago
Distributed Ranked Search
P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necess...
Vijay Gopalakrishnan, Ruggero Morselli, Bobby Bhat...
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
14 years 5 days ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
CORR
2011
Springer
189views Education» more  CORR 2011»
13 years 1 months ago
A Factorial Experiment on Scalability of Search Based Software Testing
Software testing is an expensive process, which is vital in the industry. Construction of the test-data in software testing requires the major cost and to decide which method to us...
Arash Mehrmand, Robert Feldt
SIGCOMM
2003
ACM
13 years 12 months ago
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Content-based full-text search is a challenging problem in Peer-toPeer (P2P) systems. Traditional approaches have either been centralized or use flooding to ensure accuracy of th...
Chunqiang Tang, Zhichen Xu, Sandhya Dwarkadas