1984 search results - page 155 / 397 » The colourful feasibility problem |
148
click to vote
SCHEDULING
2010
15 years 4 months ago
2010
Scheduling term-end exams (TEE) at the United States Military Academy in West Point is unlike any other exam timetabling problem we know of. Exam timetabling normally produces a c...
197
click to vote
CNSM
2010
2010
Facing the unpredictable: Automated adaption of IT change plans for unpredictable management domains
15 years 4 months ago
Abstract--Change Management, a core process of the Information Technology Infrastructure Library (ITIL), is concerned with the management of changes to IT infrastructure and servic...
164
click to vote
JMLR
2010
15 years 1 months ago
2010
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
164
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
162
click to vote
Publication
Recognizing multiple interleaved activities in a video requires implicitly partitioning the detections for each activity. Furthermore, constraints between activities are important ...