Sciweavers

204 search results - page 20 / 41
» On Constrained Minimum Pseudotriangulations
Sort
View
SIGPRO
2002
80views more  SIGPRO 2002»
13 years 7 months ago
Design of optimum high-order finite-wordlength digital FIR filters with linear phase
Abstract-A novel iterative quantization procedure for the design of finite wordlength linear phase FIR filters of high order and minimum frequency domain error is proposed: a one b...
Gennaro Evangelista
TIT
2002
73views more  TIT 2002»
13 years 7 months ago
Power levels and packet lengths in random multiple access
This paper extends our earlier results. We assume that the receiver has the capability of capturing multiple packets so long as the signal-to-interference-plus-noise ratio (SINR) o...
Wei Luo, Anthony Ephremides
ICALP
2011
Springer
12 years 11 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
ICC
2007
IEEE
14 years 2 months ago
ORC-GPS: Output Rate-Controlled Scheduling Policy for Delay Guarantees
Abstract—Recently packet scheduling algorithms such as Packetized GPS (PGPS), Worst-case Fair Weighted Fair Queueing (WF2 Q) and Self-Clocked Fair Queueing (SCFQ) have been propo...
Masaki Hanada, Hidenori Nakazato
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
14 years 1 months ago
Sex and death: towards biologically inspired heuristics for constraint handling
Constrained continuous optimization is still an interesting field of research. Many heuristics have been proposed in the last decade. Most of them are based on penalty functions....
Oliver Kramer, Stephan Brügger, Dejan Lazovic