428 search results - page 34 / 86 » An asynchronous complete method for distributed constraint o... |
136
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
133
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract—Coping with outliers contaminating dynamical processes is of major importance in various applications because mismatches from nominal models are not uncommon in practice...
98
Voted
COR
2010
15 years 3 months ago
2010
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
138
click to vote
ATAL
2003
Springer
15 years 8 months ago
2003
Springer
Coalition formation methods allow agents to join together and are thus necessary in cases where tasks can only be performed cooperatively by groups. This is the case in the Reques...
150
click to vote
JMLR
2006
15 years 3 months ago
2006
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...