2089 search results - page 307 / 418 » A New Problem in String Searching |
CIKM
2001
Springer
15 years 2 months ago
2001
Springer
Given the ranked lists of documents returned by multiple search engines in response to a given query, the problem of metasearch is to combine these lists in a way which optimizes ...
122
click to vote
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
FMCAD
2006
Springer
15 years 1 months ago
2006
Springer
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...
AMAI
2000
Springer
15 years 1 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
CEC
2007
IEEE
14 years 11 months ago
2007
IEEE
— As there are many good optimization algorithms each with its own characteristics, it is very difficult to choose the best method for optimization problems. Thus, it is importa...