428 search results - page 71 / 86 » An asynchronous complete method for distributed constraint o... |
120
click to vote
KDD
2012
ACM
13 years 2 months ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
190
click to vote
ICLP
2009
Springer
16 years 10 days ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
105
click to vote
TROB
2002
14 years 11 months ago
2002
This paper uses a configuration space ( -space) based method to compute interference-free configuration for stacking polyhedral sheet metal parts. This work forms the interference ...
FSTTCS
2007
Springer
15 years 5 months ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...