Sciweavers

5153 search results - page 925 / 1031
» Introduction to Randomized Algorithms
Sort
View
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
14 years 9 months ago
Pathologies of temporal difference methods in approximate dynamic programming
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
Dimitri P. Bertsekas
CDC
2010
IEEE
115views Control Systems» more  CDC 2010»
14 years 9 months ago
Distributed statistical estimation of the number of nodes in sensor networks
The distributed estimation of the number of active sensors in a network can be important for estimation and organization purposes. We propose a design methodology based on the foll...
Damiano Varagnolo, Gianluigi Pillonetto, Luca Sche...
COR
2011
14 years 9 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic
CORR
2011
Springer
172views Education» more  CORR 2011»
14 years 9 months ago
SafeVchat: Detecting Obscene Content and Misbehaving Users in Online Video Chat Services
Online video chat services such as Chatroulette, Omegle, and vChatter that randomly match pairs of users in video chat sessions are fast becoming very popular, with over a million...
Xinyu Xing, Yu-Li Liang, Hanqiang Cheng, Jianxun D...
124
Voted
CORR
2011
Springer
198views Education» more  CORR 2011»
14 years 9 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski