Sciweavers

2609 search results - page 173 / 522
» Models for Global Constraint Applications
Sort
View
IJCAI
2001
15 years 7 months ago
Temporal Decision Trees or the lazy ECU vindicated
The automatic generation of diagnostic decision trees from qualitative models is a reasonable compromise between the advantages of using a modelbased approach in technical domains...
Luca Console, Claudia Picardi, Daniele Theseider D...
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 6 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
IPPS
1998
IEEE
15 years 10 months ago
Migration and Rollback Transparency for Arbitrary Distributed Applications in Workstation Clusters
Programmers and users of compute intensive scientific applications often do not want to (or even cannot) code load balancing and fault tolerance into their programs. The PBEAM syst...
Stefan Petri, Matthias Bolz, Horst Langendörf...
AUSAI
2009
Springer
15 years 10 months ago
Classification-Assisted Memetic Algorithms for Equality-Constrained Optimization Problems
Regressions has successfully been incorporated into memetic algorithm (MA) to build surrogate models for the objective or constraint landscape of optimization problems. This helps ...
Stephanus Daniel Handoko, Chee Keong Kwoh, Yew-Soo...
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 8 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich