Sciweavers

14158 search results - page 410 / 2832
» Generalized switch-setting problems
Sort
View
AAAI
2004
15 years 6 months ago
An Effective Algorithm for Project Scheduling with Arbitrary Temporal Constraints
The resource-constrained project scheduling problem with time windows (RCPSP/max) is an important generalization of a number of well studied scheduling problems. In this paper, we...
Tristan B. Smith, John M. Pyle
AI
1998
Springer
15 years 9 months ago
A Heuristic Incremental Modeling Approach to Course Timetabling
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
Don Banks, Peter van Beek, Amnon Meisels
TCS
2008
15 years 5 months ago
Approximation algorithms for partially covering with edges
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
Ojas Parekh
COCOON
2004
Springer
15 years 10 months ago
New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation
This paper studies the on-demand broadcasting problem with deadlines. We give the first general upper bound and improve existing lower bounds on the com
Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudenc...
ICML
2007
IEEE
16 years 5 months ago
Transductive support vector machines for structured variables
We study the problem of learning kernel machines transductively for structured output variables. Transductive learning can be reduced to combinatorial optimization problems over a...
Alexander Zien, Ulf Brefeld, Tobias Scheffer