680 search results - page 118 / 136 » Computational Complexity and Anytime Algorithm for Inconsist... |
ERCIMDL
1999
Springer
14 years 2 days ago
1999
Springer
Resource discovery in a distributed digital library poses many challenges, one of which is how to choose search engines for query distribution, given a query and a set of search e...
IDA
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
BIOCOMP
2007
13 years 9 months ago
2007
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ď...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Network tomography has been proposed to ascertain internal network performances from end-to-end measurements. In this work, we present priority probing, an optimal probing schem...
PADS
2004
ACM
14 years 1 months ago
2004
ACM
Computer simulation is the most common approach to studying wireless ad-hoc routing algorithms. The results, however, are only as good as the models the simulation uses. One shoul...