Sciweavers

3475 search results - page 291 / 695
» Backbones in Optimization and Approximation
Sort
View
COMPGEOM
2005
ACM
15 years 8 months ago
Finding the best shortcut in a geometric network
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmu...
AAAI
2006
15 years 8 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 8 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
WSC
2004
15 years 8 months ago
Adaptive Control Variates
Adaptive Monte Carlo methods are specialized Monte Carlo simulation techniques where the methods are adaptively tuned as the simulation progresses. The primary focus of such techn...
Sujin Kim, Shane G. Henderson
NIPS
2000
15 years 8 months ago
Analysis of Bit Error Probability of Direct-Sequence CDMA Multiuser Demodulators
We analyze the bit error probability of multiuser demodulators for directsequence binary phase-shift-keying (DS/BPSK) CDMA channel with additive gaussian noise. The problem of mul...
Toshiyuki Tanaka