1033 search results - page 203 / 207 » The Relative History Heuristic |
120
click to vote
IPM
2007
14 years 11 months ago
2007
In this paper, we propose a multi-strategic matching and merging approach to find correspondences between ontologies based on the syntactic or semantic characteristics and constr...
100
click to vote
JPDC
2007
14 years 11 months ago
2007
In this paper, we address the problem of multiple sequence alignment (MSA) for handling very large number of proteins sequences on mesh-based multiprocessor architectures. As the ...
CN
2004
14 years 11 months ago
2004
There are two basic types of interconnection agreements between providers in the Internet: peering and transit. A decision every Internet network service provider (INSP) has to ma...
118
click to vote
ALGORITHMICA
2000
14 years 11 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
124
click to vote
BMCBI
2002
14 years 11 months ago
2002
Background: Biologists are often interested in performing a simple database search to identify proteins or genes that contain a well-defined sequence pattern. Many databases do no...