Sciweavers

9716 search results - page 320 / 1944
» The Case for Energy-Proportional Computing
Sort
View
178
Voted
CIG
2006
IEEE
16 years 27 days ago
Voronoi game on graphs and its complexity
The Voronoi game is a two-person game which is a model for a competitive facility location. The game is done on a continuous domain, and only two special cases (1-dimensional case ...
Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara
INFOCOM
1993
IEEE
15 years 11 months ago
Queueing Delays in Rate Controlled ATM Networks
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bounds in ATM networks with rate-controlled, non-work conserving servers. A theore...
Anindo Banerjea, Srinivasan Keshav
GLVLSI
2009
IEEE
159views VLSI» more  GLVLSI 2009»
16 years 1 months ago
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
Renshen Wang, Chung-Kuan Cheng
PARA
2004
Springer
16 years 5 days ago
New Algorithms for Statistical Analysis of Interval Data
It is known that in general, statistical analysis of interval data is an NP-hard problem: even computing the variance of interval data is, in general, NP-hard. Until now, only one ...
Gang Xiang, Scott A. Starks, Vladik Kreinovich, Lu...
MOC
2000
85views more  MOC 2000»
15 years 6 months ago
Conjugacy classes in finite permutation groups via homomorphic images
The lifting of results from factor groups to the full group is a standard technique for solvable groups. This paper shows how to utilize this approach in the case of non-solvable n...
Alexander Hulpke