16404 search results - page 677 / 3281 » A set coverage problem |
191
click to vote
CSCLP
2007
Springer
16 years 1 months ago
2007
Springer
We formulate a problem of goal satisfaction in mutex networks in this paper. The proposed problem is motivated by problems that arise in concurrent planning. For more efficient sol...
177
click to vote
SCALESPACE
2005
Springer
16 years 21 days ago
2005
Springer
We study the connection between higher order total variation (TV) regularization and support vector regression (SVR) with spline kernels in a one-dimensional discrete setting. We p...
170
click to vote
EVOW
2001
Springer
15 years 11 months ago
2001
Springer
This work presents a constructive approach to the process of fixing a sequence of meetings between teachers and students in a prefixed period of time, satisfying a set of constrain...
187
click to vote
CEC
2005
IEEE
15 years 9 months ago
2005
IEEE
Timetabling problems are constraint optimization problems proven to be NP complete. Furthermore, evaluation of violations is costly, and there is no common data format for represen...
187
click to vote
IDA
2008
Springer
15 years 7 months ago
2008
Springer
Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory pro...