388 search results - page 66 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
JAL
2006
14 years 11 months ago
2006
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
174
click to vote
AGP
2010
IEEE
15 years 4 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
115
click to vote
PRIB
2009
Springer
15 years 6 months ago
2009
Springer
For many biomedical modelling tasks a number of different types of data may influence predictions made by the model. An established approach to pursuing supervised learning with ...
180
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Despite the surge of interest in data reduction techniques over the past years, no method has been proposed to date that can always achieve approximation quality preferable to that...
AI
2007
Springer
15 years 5 months ago
2007
Springer
When using Bayesian networks, practitioners often express constraints among variables by conditioning a common child node to induce the desired distribution. For example, an ‘orâ...