Sciweavers

285 search results - page 43 / 57
» A New Heuristic for Optimizing Large Queries
Sort
View
AI
1998
Springer
13 years 7 months ago
A Complete Anytime Algorithm for Number Partitioning
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
Richard E. Korf
BIBE
2007
IEEE
138views Bioinformatics» more  BIBE 2007»
14 years 1 months ago
A Flexible Stem-Based Local Search Algorithm for Predicting RNA Secondary Structures Including Pseudoknots
-We demonstrate a new algorithm named FlexStem to predict RNA secondary structures with pseudoknots. Our approach is based on the free energy minimization criterion, and utilizes a...
Xiang Chen, Simin He, Dongbo Bu, Runsheng Chen, We...
ICASSP
2010
IEEE
13 years 2 months ago
Search error risk minimization in Viterbi beam search for speech recognition
This paper proposes a method to optimize Viterbi beam search based on search error risk minimization in large vocabulary continuous speech recognition (LVCSR). Most speech recogni...
Takaaki Hori, Shinji Watanabe, Atsushi Nakamura
MIDDLEWARE
2007
Springer
14 years 1 months ago
A piggybacking approach to reduce overhead in sensor network gossiping
Many wireless sensor network protocols are employing gossipbased message dissemination, where nodes probabilistically forward messages, to reduce message overhead. We are concerne...
Ercan Ucan, Nathanael Thompson, Indranil Gupta
JSS
2007
120views more  JSS 2007»
13 years 7 months ago
The design and evaluation of path matching schemes on compressed control flow traces
A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually of very large size and therefore commonly stored in com...
Yongjing Lin, Youtao Zhang, Rajiv Gupta