Sciweavers

4524 search results - page 111 / 905
» The Complexity of Global Constraints
Sort
View
PPSN
2010
Springer
14 years 11 months ago
Globally Induced Model Trees: An Evolutionary Approach
In the paper we propose a new evolutionary algorithm for induction of univariate regression trees that associate leaves with simple linear regression models. In contrast to typical...
Marcin Czajkowski, Marek Kretowski
ISMIS
2011
Springer
14 years 3 months ago
An Evolutionary Algorithm for Global Induction of Regression Trees with Multivariate Linear Models
In the paper we present a new evolutionary algorithm for induction of regression trees. In contrast to the typical top-down approaches it globally searches for the best tree struct...
Marcin Czajkowski, Marek Kretowski
AUSAI
2006
Springer
15 years 4 months ago
Finite Domain Bounds Consistency Revisited
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagati...
Chiu Wo Choi, Warwick Harvey, J. H. M. Lee, Peter ...
101
Voted
CSL
2006
Springer
15 years 4 months ago
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
Manuel Bodirsky, Hubie Chen
132
Voted
ICCV
2001
IEEE
16 years 2 months ago
Continuous Global Evidence-Based Bayesian Modality Fusion for Simultaneous Tracking of Multiple Objects
Robust, real-time tracking of objects from visual data requires probabilistic fusion of multiple visual cues. Previous approaches have either been ad hoc or relied on a Bayesian n...
Jamie Sherrah, Shaogang Gong