Sciweavers

1695 search results - page 303 / 339
» Linear, Polynomial or Exponential
Sort
View
DAM
2006
132views more  DAM 2006»
15 years 23 days ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler
JCO
2006
126views more  JCO 2006»
15 years 22 days ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...
100
Voted
SIAMSC
2008
146views more  SIAMSC 2008»
15 years 20 days ago
A Continuous Interior Penalty Method for Viscoelastic Flows
In this paper we consider a finite element discretization of the Oldroyd-B model of viscoelastic flows. The method uses standard continuous polynomial finite element spaces for vel...
Andrea Bonito, Erik Burman
SIAMSC
2008
191views more  SIAMSC 2008»
15 years 20 days ago
ORBIT: Optimization by Radial Basis Function Interpolation in Trust-Regions
Abstract. We present a new derivative-free algorithm, ORBIT, for unconstrained local optimization of computationally expensive functions. A trust-region framework using interpolati...
Stefan M. Wild, Rommel G. Regis, Christine A. Shoe...
78
Voted
TCOM
2008
63views more  TCOM 2008»
15 years 20 days ago
A general construction of constrained parity-check codes for optical recording
This paper proposes a general and systematic code design method to efficiently combine constrained codes with parity-check (PC) codes for optical recording. The proposed constraine...
Kui Cai, Kees A. Schouhamer Immink