Sciweavers

5214 search results - page 266 / 1043
» The Online Specialization Problem
Sort
View
ANOR
2010
130views more  ANOR 2010»
15 years 3 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
ECRTS
2004
IEEE
15 years 10 months ago
On Energy-Constrained Real-Time Scheduling
In this paper, we explore the feasibility and performance optimization problems for real-time systems that must remain functional during an operation/mission with a fixed, initial...
Tarek A. AlEnawy, Hakan Aydin
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
15 years 9 months ago
Graph Coloring with Rejection
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
Leah Epstein, Asaf Levin, Gerhard J. Woeginger
ICDE
2007
IEEE
139views Database» more  ICDE 2007»
16 years 15 days ago
Integrating OLAP and Ranking: The Ranking-Cube Methodology
OLAP (On-Line Analytical Processing) and Ranking are currently separate technologies in the database systems. OLAP emphasizes on efficient multidimensional data analysis and ranki...
Dong Xin, Jiawei Han
ISMAR
2002
IEEE
15 years 11 months ago
Reconstructing While Registering: A Novel Approach for Markerless Augmented Reality
This paper addresses the registration problem for unprepared multi-planar scenes. An interactive process is proposed to get accurate results using nothing else than the texture in...
Gilles Simon, Marie-Odile Berger