Sciweavers

3055 search results - page 126 / 611
» Randomized Search Trees
Sort
View
IJAHUC
2008
118views more  IJAHUC 2008»
13 years 10 months ago
Analysis models for unguided search in unstructured P2P networks
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
Bin Wu, Ajay D. Kshemkalyani
CCE
2006
13 years 10 months ago
Design of heat exchanger networks using randomized algorithm
A randomized algorithm with stream splitting for design of heat exchanger networks is presented in this work. The algorithm has provisions for splitting any one of the process str...
Ankur Pariyani, Abhigyan Gupta, Pallab Ghosh
CPAIOR
2007
Springer
14 years 4 months ago
Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search
Abstract. This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic ...
Sivan Sabato, Yehuda Naveh
CORR
2011
Springer
189views Education» more  CORR 2011»
13 years 5 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
RSA
2010
89views more  RSA 2010»
13 years 8 months ago
Edge flows in the complete random-lengths network
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow ...
David J. Aldous, Shankar Bhamidi