Sciweavers

132 search results - page 16 / 27
» A Simple Test for Interval Graphs
Sort
View
SPAA
2010
ACM
14 years 10 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
SIGMETRICS
1996
ACM
122views Hardware» more  SIGMETRICS 1996»
15 years 2 months ago
Experiments with Digital Video Playback
In this paper we describe our experiments on digital video applications, concentrating on the static and dynamic tradeo s involved in video playback. Our results were extracted fr...
Richard Gerber, Ladan Gharai
EOR
2007
158views more  EOR 2007»
14 years 10 months ago
A graph-based hyper-heuristic for educational timetabling problems
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
Edmund K. Burke, Barry McCollum, Amnon Meisels, Sa...
COCOON
2001
Springer
15 years 2 months ago
PC-Trees vs. PQ-Trees
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
Wen-Lian Hsu
ICCV
2007
IEEE
15 years 12 months ago
Probabilistic Color and Adaptive Multi-Feature Tracking with Dynamically Switched Priority Between Cues
We present a probabilistic multi-cue tracking approach constructed by employing a novel randomized template tracker and a constant color model based particle filter. Our approach ...
François Le Clerc, Lionel Oisel, Patrick P&...