Sciweavers

3082 search results - page 41 / 617
» New Bounds for the Controller Problem
Sort
View
137
Voted
EVOW
2007
Springer
15 years 9 months ago
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
Sandro Pirkwieser, Günther R. Raidl, Jakob Pu...
130
Voted
WOWMOM
2005
ACM
184views Multimedia» more  WOWMOM 2005»
15 years 9 months ago
ALCA: A New Scheme for Power Control on 802.11 Ad Hoc Networks
— This paper presents the ALCA (Asymmetric Link Collision Avoidance) protocol. ALCA was designed to deal with a known deficiency of the Basic Scheme [1] for power control in 802...
Alexandre Andrade Pires, José Ferreira de R...
117
Voted
JSCIC
2008
66views more  JSCIC 2008»
15 years 3 months ago
Substructuring Preconditioners for Mortar Discretization of a Degenerate Evolution Problem
In this paper we present new efficient variants of structured preconditioners for algebraic linear systems arising from the mortar discretization of a degenerate parabolic system o...
Micol Pennacchio, Valeria Simoncini
134
Voted
EOR
2008
79views more  EOR 2008»
15 years 3 months ago
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
Konstantinos Kaparis, Adam N. Letchford
127
Voted
AMC
2010
126views more  AMC 2010»
15 years 3 months ago
On condition numbers of polynomial eigenvalue problems
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix pertur...
Nikolaos Papathanasiou, Panayiotis Psarrakos