Sciweavers

Share
EVOW
2007
Springer
9 years 7 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...
SEFM
2008
IEEE
9 years 7 months ago
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
Tuan-Hung Pham, Anh-Hoang Truong, Ninh-Thuan Truon...
GLOBECOM
2008
IEEE
9 years 7 months ago
Rate Adaptation Using Acknowledgement Feedback: Throughput Upper Bounds
—We consider packet-by-packet rate adaptation to maximize the throughput over a finite-state Markov channel. To limit the amount of feedback data, we use past packet acknowledge...
Chin Keong Ho, Job Oostveen, Jean-Paul M. G. Linna...
FM
2009
Springer
123views Formal Methods» more  FM 2009»
9 years 7 months ago
"Carbon Credits" for Resource-Bounded Computations Using Amortised Analysis
Abstract. Bounding resource usage is important for a number of areas, notably real-time embedded systems and safety-critical systems. In this paper, we present a fully automatic st...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
ICC
2009
IEEE
165views Communications» more  ICC 2009»
9 years 8 months ago
Arbitrarily Tight Upper and Lower Bounds on the Gaussian Q-Function and Related Functions
—We present a new family of tight lower and upper bounds on the Gaussian Q-function Q(x). It is first shown that, for any x, the integrand ϕ(θ; x) of the Craig representation ...
Giuseppe Thadeu Freitas de Abreu
FOCS
2009
IEEE
9 years 8 months ago
Higher Eigenvalues of Graphs
— We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the kth smallest eigenva...
Jonathan A. Kelner, James R. Lee, Gregory N. Price...
BIRTHDAY
2009
Springer
9 years 8 months ago
Polynomial Precise Interval Analysis Revisited
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
Thomas Gawlitza, Jérôme Leroux, Jan R...
ALT
2008
Springer
9 years 10 months ago
Online Regret Bounds for Markov Decision Processes with Deterministic Transitions
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...
Ronald Ortner
MOBIHOC
2001
ACM
10 years 26 days ago
A probabilistic analysis for the range assignment problem in ad hoc networks
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...
Paolo Santi, Douglas M. Blough, Feodor S. Vainstei...
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
10 years 1 months ago
New degree bounds for polynomial threshold functions
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
Ryan O'Donnell, Rocco A. Servedio
books