Sciweavers

829 search results - page 81 / 166
» Bandit Algorithms for Tree Search
Sort
View
AAAI
1998
14 years 11 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
BIBE
2006
IEEE
119views Bioinformatics» more  BIBE 2006»
15 years 3 months ago
Large Grain Size Stochastic Optimization Alignment
DNA sequence alignment is a critical step in identifying homology between organisms. The most widely used alignment program, ClustalW, is known to suffer from the local minima pro...
Perry Ridge, Hyrum Carroll, Dan Sneddon, Mark J. C...
CP
2004
Springer
15 years 3 months ago
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
Vincent A. Cicirello, Stephen F. Smith
INFOCOM
2006
IEEE
15 years 3 months ago
Optimal Power Allocation in Wireless Networks with Transmitter-Receiver Power Tradeoffs
— For many wireless communication links, such as those employing turbo codes or sequentially-decoded convolutional codes, the power consumption of the decoder at the receiver dep...
Sudarshan Vasudevan, Chun Zhang, Dennis Goeckel, D...
LAWEB
2003
IEEE
15 years 3 months ago
Syntactic Similarity of Web Documents
This paper presents and compares two methods for evaluating the syntactic similarity between documents. The first method uses the Patricia tree, constructed from the original doc...
Álvaro R. Pereira Jr., Nivio Ziviani