Sciweavers

329 search results - page 33 / 66
» Probably Approximately Correct Learning
Sort
View
ICC
2009
IEEE
14 years 2 months ago
A Laplace Transform-Based Method to Stochastic Path Finding
—Finding the most likely path satisfying a requested additive Quality-of-Service (QoS) value, such as delay, when link metrics are defined as random variables by known probabili...
Suleyman Uludag, Ziyneti Elif Uludag, Klara Nahrst...
ICDIM
2007
IEEE
13 years 9 months ago
Predicting durability in DHTs using Markov chains
We consider the problem of data durability in lowbandwidth large-scale distributed storage systems. Given the limited bandwidth between replicas, these systems suffer from long re...
Fabio Picconi, Bruno Baynat, Pierre Sens
CORR
2002
Springer
113views Education» more  CORR 2002»
13 years 7 months ago
Robust Global Localization Using Clustered Particle Filtering
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...
Javier Nicolás Sánchez, Adam Milstei...
WIOPT
2010
IEEE
13 years 6 months ago
On the optimal design of MAC protocols in multi-hop ad hoc networks
Abstract—In this paper, we present our results on the performance of MAC protocols in multi-hop wireless ad hoc networks in terms of the newly proposed metric “aggregate multi-...
Mariam Kaynia, Pedro H. J. Nardell, Paulo Cardieri...
RECOMB
2007
Springer
14 years 8 months ago
Minimizing and Learning Energy Functions for Side-Chain Prediction
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
Chen Yanover, Ora Schueler-Furman, Yair Weiss