3625 search results - page 241 / 725 » On choosing |
203
click to vote
OTM
2010
Springer
15 years 5 months ago
2010
Springer
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
209
click to vote
PIMRC
2010
IEEE
15 years 5 months ago
2010
IEEE
In this paper we show how game theory and Gibbs sampling techniques can be used to design a self-optimizing algorithm for minimizing end-to-end delays for all flows in a multi-clas...
247
click to vote
PPSN
2010
Springer
15 years 5 months ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
193
click to vote
SEMWEB
2010
Springer
15 years 5 months ago
2010
Springer
One of the problems of Knowledge Discovery in Databases (KDD) is the lack of user support for solving KDD problems. Current Data Mining (DM) systems enable the user to manually des...
191
click to vote
CISSE
2009
Springer
15 years 5 months ago
2009
Springer
In Component-based Software (CBS) development, it is desirable to choose software components that provide all necessary functionalities and at the same time optimize certain nonfun...