Sciweavers

199 search results - page 4 / 40
» Complexity of two dual criteria scheduling problems
Sort
View
MOBIHOC
2007
ACM
14 years 8 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
ATAL
2009
Springer
14 years 3 months ago
On the complexity of schedule control problems for knockout tournaments
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
Thuc Vu, Alon Altman, Yoav Shoham
AIPS
2003
13 years 10 months ago
SOFIA's Choice: Scheduling Observations for an Airborne Observatory
We describe the problem of scheduling observations for an airborne astronomical observatory. The problem incorporates complex constraints relating the feasibility of an astronomic...
Jeremy Frank, Elif Kürklü
ESA
2001
Springer
145views Algorithms» more  ESA 2001»
14 years 1 months ago
Grouping Techniques for Scheduling Problems: Simpler and Faster
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastroli...
IAT
2009
IEEE
14 years 25 days ago
Confusion and Distance Metrics as Performance Criteria for Hierarchical Classification Spaces
When intelligent systems reason about complex problems with a large hierarchical classification space it is hard to evaluate system performance. For classification problems, differ...
Wilbert van Norden, Catholijn M. Jonker