Sciweavers

2200 search results - page 23 / 440
» Bloch's Constant is Computable
Sort
View
ICALP
2005
Springer
15 years 3 months ago
Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins
We study a particular aspect of the balanced allocation paradigm (also known as the “two-choices paradigm”): constant sized bins, packed as tightly as possible. Let d ≥ 1 be...
Martin Dietzfelbinger, Christoph Weidling
TCOM
2008
117views more  TCOM 2008»
14 years 9 months ago
Constant Envelope OFDM
This paper describes a transformation technique aimed at solving the peak-to-average power ratio (PAPR) problem associated with OFDM (orthogonal frequency-division multiplexing). C...
Steve C. Thompson, Ahsen U. Ahmed, John G. Proakis...
CSDA
2004
77views more  CSDA 2004»
14 years 9 months ago
Variable selection bias in regression trees with constant fits
The greedy search approach to variable selection in regression trees with constant fits is considered. At each node, the method usually compares the maximally selected statistic a...
Yu-Shan Shih, Hsin-Wen Tsai
CDC
2009
IEEE
120views Control Systems» more  CDC 2009»
15 years 2 months ago
Towards constant velocity Navigation and collision avoidance for autonomous nonholonomic aircraft-like vehicles
Abstract— This paper presents a methodology for the decentralised control of multiple 3-dimensional nonholonomic agents. The proposed control scheme is based on Navigation Functi...
Giannis P. Roussos, Kostas J. Kyriakopoulos
EUROPAR
2001
Springer
15 years 2 months ago
Optimal Many-to-One Routing on the Mesh with Constant Queues
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
Andrea Pietracaprina, Geppino Pucci