388 search results - page 44 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
108
click to vote
ECAI
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
124
click to vote
AAAI
1994
15 years 1 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
111
click to vote
ICA
2010
Springer
15 years 26 days ago
2010
Springer
Independent Component Analysis is the best known method for solving blind source separation problems. In general, the number of sources must be known in advance. In many cases, pre...
CGF
1999
14 years 11 months ago
1999
This paper presents a single-pass, view-dependent method to solve the rendering equation, using a stochastic iterational scheme where the transport operator is selected randomly i...
110
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
In this paper an algorithm based on the ensemble empirical mode decomposition (EEMD) is presented. The key idea on the EEMD relies on averaging the modes obtained by EMD applied t...