1795 search results - page 133 / 359 » Search by strategy |
138
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper we present the results of parallelizing two life sciences applications, Markov random fieldsbased (MRF) liver segmentation and HMMER’s Viterbi algorithm, using GP...
172
click to vote
CCCG
2008
15 years 7 months ago
2008
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
162
click to vote
CP
2009
Springer
15 years 4 months ago
2009
Springer
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
187
click to vote
ICAI
2004
15 years 7 months ago
2004
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...
161
click to vote
SIGIR
2010
ACM
15 years 10 months ago
2010
ACM
When search engine users have trouble finding information, they may become frustrated, possibly resulting in a bad experience (even if they are ultimately successful). In a user ...