221 search results - page 32 / 45 » New formulations for the Kissing Number Problem |
114
click to vote
DATAMINE
1999
14 years 9 months ago
1999
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...
CPAIOR
2006
Springer
15 years 1 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
84
Voted
KDD
2000
ACM
15 years 1 months ago
2000
ACM
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
JSS
2011
14 years 15 days ago
2011
: A web service may evolve autonomously, making peer web services in the same service composition uncertain as to whether the evolved behaviors are compatible with its original col...