Sciweavers

359 search results - page 11 / 72
» On Complete Primitives for Fairness
Sort
View
ICFP
2003
ACM
14 years 7 months ago
A sound and complete axiomatization of delimited continuations
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
Yukiyoshi Kameyama, Masahito Hasegawa
CVPR
2010
IEEE
13 years 9 months ago
Robust Piecewise-Planar 3D Reconstruction and Completion from Large-Scale Unstructured Point Data
In this paper, we present a novel method, the first to date to our knowledge, which is capable of directly and automatically producing a concise and idealized 3D representation f...
Anne-Laure Chauve, Patrick Labatut, Jean-Philippe ...
GLOBECOM
2007
IEEE
13 years 9 months ago
A Cross-Layer Proportional Fair Scheduling Algorithm with Packet Length Constraint in Multiuser OFDM Networks
— 1 In this paper, we investigate the proportional fair scheduling (PFS) problem for multiuser OFDM systems, considering the impact of packet length. Packet length influences sc...
Jinri Huang, Zhisheng Niu
CCR
2008
83views more  CCR 2008»
13 years 7 months ago
Stability and fairness of explicit congestion control with small buffers
Rate control protocols that utilise explicit feedback from routers are able to achieve fast convergence to an equilibrium which approximates processor-sharing on a single bottlene...
Frank P. Kelly, Gaurav Raina, Thomas Voice
SEFM
2009
IEEE
14 years 2 months ago
Adjusted Verification Rules for Loops Are More Complete and Give Better Diagnostics for Less
—Increasingly, tools and their underlying theories are able to cope with “real code” written as part of industrial grade applications almost as is. It has been our experience...
Patrice Chalin