3841 search results - page 172 / 769 » Crowdsourcing for search evaluation |
180
click to vote
AIPS
2010
15 years 8 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
203
click to vote
BIBE
2008
IEEE
16 years 1 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
171
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
185
click to vote
IR
2007
15 years 6 months ago
2007
This paper reports on the underlying IR problems encountered when indexing and searching with the Bulgarian language. For this language we propose a general light stemmer and demon...
198
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: BLAST is one of the most common and useful tools for Genetic Research. This paper describes a software application we have termed Windows .NET Distributed Basic Local ...