Sciweavers

113 search results - page 4 / 23
» Simpler is also better in approximating fixed points
Sort
View
TSP
2008
86views more  TSP 2008»
13 years 7 months ago
Fixed-Complexity Soft MIMO Detection via Partial Marginalization
Abstract--This paper presents a new approach to soft demodulation for MIMO channels. The proposed method is an approximation to the exact a posteriori probability-per-bit computer....
Erik G. Larsson, Joakim Jalden
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
13 years 7 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
JCO
2010
169views more  JCO 2010»
13 years 5 months ago
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Shiyan Hu
EOR
2008
123views more  EOR 2008»
13 years 7 months ago
Fixed versus flexible production systems: A real options analysis
In this work, we address investment decisions in production systems by using real options. As is standard in literature, the stochastic variable is assumed to be normally distribu...
Dalila B. M. M. Fontes
SLOGICA
2008
126views more  SLOGICA 2008»
13 years 7 months ago
On the Proof Theory of the Modal mu-Calculus
We study the proof-theoretic relationship between two deductive systems for the modal mu-calculus. First we recall an infinitary system which contains an omega rule allowing to de...
Thomas Studer