Sciweavers

30 search results - page 3 / 6
» An optimal investment problem with randomly terminating inco...
Sort
View
CISS
2008
IEEE
14 years 2 months ago
On the delay and throughput of digital and analog network coding for wireless broadcast
— We address the problem of exchanging broadcast packets among multiple wireless terminals through a single relay node. The objective is to evaluate the delay and throughput gain...
Yalin Evren Sagduyu, Dongning Guo, Randall Berry
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
13 years 11 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
WSC
2004
13 years 9 months ago
Stochastic Approximation with Simulated Annealing as an Approach to Global Discrete-Event Simulation Optimization
This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...
Matthew H. Jones, K. Preston White
FUZZY
1997
Springer
166views Fuzzy Logic» more  FUZZY 1997»
13 years 11 months ago
Optimizing Video Signal Processing Algorithms by Evolution Strategies
Today many kinds of postprocessing are used in digital TV receivers or multimedia terminals for video signals to enhance the picture quality. To achieve this the properties of hum...
H. Blume, O. Franzen, M. Schmidt
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
14 years 12 days ago
An Improved LP-based Approximation for Steiner Tree
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...