Zur Hauptnavigation wechseln
Zur Suche wechseln
Zum Hauptinhalt wechseln
Technische Universität München Home
Hilfe und FAQ
English
Deutsch
Home
Personen
Einrichtungen
Projekte
Publikationen
Auszeichnungen
Aktivitäten
Presseberichte
Nach Expertise, Namen oder Zugehörigkeit suchen
Optimal Algorithms for Right-sizing Data Centers
Susanne Albers
, Jens Quedenfeld
Informatik 14 - Lehrstuhl für Algorithmen und Komplexität
Technische Universität München
Publikation
:
Beitrag in Fachzeitschrift
›
Artikel
›
Begutachtung
Übersicht (Administrator/-in)
Fingerprint
Fingerprint
Untersuchen Sie die Forschungsthemen von „Optimal Algorithms for Right-sizing Data Centers“. Zusammen bilden sie einen einzigartigen Fingerprint.
sortieren
Gewicht:
Alphabetisch
Keyphrases
Optimization Problem
100%
Optimal Algorithm
100%
Operating Cost
100%
Capacity Provisioning
100%
Rightsizing
100%
Active Servers
100%
Online Algorithms
66%
Competitive Ratio
66%
Randomized Online Algorithm
66%
Data Center Optimization
66%
Feasible Solution
33%
Polynomial Time
33%
Cost Function
33%
Discrete Set
33%
Computing Capacity
33%
Convex Function
33%
Binary Search
33%
Consumed Energy
33%
Extended Period
33%
Integral Solution
33%
Electricity Cost
33%
Capacity Management
33%
Oblivious Adversary
33%
Competitive Algorithm
33%
Management Challenges
33%
Online Problem
33%
Switching Costs
33%
Discrete Problem
33%
Restricted Model
33%
Integer Values
33%
Graph Theoretic Models
33%
Randomized Rounding
33%
Layered Graph
33%
Discrete Data
33%
Varying Demand
33%
Combined Objective Function
33%
Am(III)
33%
Computer Science
Optimal Algorithm
100%
Data Center
100%
on-line algorithm
80%
Optimization Problem
60%
Operating Cost
60%
Competitive Ratio
40%
Theoretic Model
20%
Capacity Management
20%
Fractional Value
20%
Objective Function
20%
Polynomial Time
20%
Feasible Solution
20%
Convex Function
20%
Integral Solution
20%
Mathematics
Data Center
100%
Competitive Ratio
40%
Objective Function
20%
Periodic Time
20%
Upper Bound
20%
Cost Function
20%
Minimizes
20%
Integer
20%
Convex Function
20%
Integral Solution
20%
Randomized Rounding
20%
Restricted Model
20%
Feasible Solution
20%
Polynomial Time
20%