430 search results - page 15 / 86 » On Using Satisfiability-Based Pruning Techniques in Covering... |
ANTSW
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
EKAW
2006
Springer
15 years 2 months ago
2006
Springer
Robust mechanisms for ontology selection are crucial for the evolving Semantic Web characterized by rapidly increasing numbers of online ontologies and by applications that automat...
PARELEC
2002
IEEE
15 years 3 months ago
2002
IEEE
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises t...
TKDE
2010
14 years 8 months ago
2010
—We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises...