Sciweavers

3934 search results - page 228 / 787
» Approximate Schedulability Analysis
Sort
View
ATAL
2007
Springer
16 years 22 days ago
Constraint satisfaction algorithms for graphical games
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
Vishal Soni, Satinder P. Singh, Michael P. Wellman
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
16 years 2 days ago
On strip packing With rotations
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
Klaus Jansen, Rob van Stee
ASAP
2010
IEEE
193views Hardware» more  ASAP 2010»
15 years 8 months ago
Automatic generation of polynomial-based hardware architectures for function evaluation
Abstract--Polynomial approximation is a very general technique for the evaluation of a wide class of numerical functions of one variable. This article details an architecture gener...
Florent de Dinechin, Mioara Joldes, Bogdan Pasca
MOBIHOC
2008
ACM
16 years 6 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang
INFOCOM
2006
IEEE
16 years 17 days ago
Flow Scheduling for End-Host Multihoming
Abstract— Fueled by the competing DSL and Cable technologies, residential broadband access has seen a significant spread in availability to the point that many users have a choi...
Nathanael Thompson, Guanghui He, Haiyun Luo