2261 search results - page 382 / 453 » The problem with scalability |
113
click to vote
AAAI
2007
15 years 3 months ago
2007
In this paper, we consider the problem of composing a set of web services, where the requirements are specified in terms of the input and output messages of the composite workfl...
114
click to vote
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
113
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
This paper extends an adaptive discretization method, Spliton-Demand (SoD), to be capable of handling multidimensional continuous search spaces. The proposed extension is called m...
127
Voted
KDD
2002
ACM
16 years 1 months ago
2002
ACM
The problem of analyzing microarray data became one of important topics in bioinformatics over the past several years, and different data mining techniques have been proposed for ...
144
click to vote
SIGIR
2008
ACM
15 years 1 months ago
2008
ACM
We study in this paper the problem of bridging the semantic gap between low-level image features and high-level semantic concepts, which is the key hindrance in content-based imag...