Sciweavers

4266 search results - page 196 / 854
» Search for More Declarativity
Sort
View
AIPS
2011
14 years 10 months ago
Searching for Plans with Carefully Designed Probes
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
Nir Lipovetzky, Hector Geffner
CLEF
2011
Springer
14 years 6 months ago
Towards a Living Lab for Information Retrieval Research and Development - A Proposal for a Living Lab for Product Search Tasks
Abstract. The notion of having a “living lab” to undertaken evaluations has been proposed by a number of proponents within the field of Information Retrieval (IR). However, wh...
Leif Azzopardi, Krisztian Balog
BMCBI
2010
101views more  BMCBI 2010»
15 years 6 months ago
Hidden Markov model speed heuristic and iterative HMM search procedure
Background: Profile hidden Markov models (profile-HMMs) are sensitive tools for remote protein homology detection, but the main scoring algorithms, Viterbi or Forward, require con...
L. Steven Johnson, Sean R. Eddy, Elon Portugaly
RECOMB
2005
Springer
16 years 7 months ago
A Hidden Markov Model Based Scoring Function for Mass Spectrometry Database Search
An accurate scoring function for database search is crucial for peptide identification using tandem mass spectrometry. Although many mathematical models have been proposed to scor...
Yunhu Wan, Ting Chen
ICCD
2001
IEEE
103views Hardware» more  ICCD 2001»
16 years 3 months ago
Fixed-outline Floorplanning through Better Local Search
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice o...
Saurabh N. Adya, Igor L. Markov