Sciweavers

1275 search results - page 177 / 255
» A Simple Focused Crawler
Sort
View
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
13 years 4 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
RSA
2011
124views more  RSA 2011»
13 years 4 months ago
Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Béla Bollobás, Svante Janson, Oliver...
TCS
2011
13 years 4 months ago
Smart PAC-learners
The PAC-learning model is distribution-independent in the sense that the learner must reach a learning goal with a limited number of labeled random examples without any prior know...
Malte Darnstädt, Hans-Ulrich Simon
IJNSEC
2010
151views more  IJNSEC 2010»
13 years 3 months ago
Performance Evaluation of Mobility Speed over MANET Routing Protocols
Ad-hoc networking is a concept in computer communications. Each node participating in the network acts both as host and a router and must therefore is willing to forward packets f...
Yasser Kamal Hassan, Mohamed Hashim Abd El-Aziz, A...
TON
2010
198views more  TON 2010»
13 years 3 months ago
On Wireless Scheduling Algorithms for Minimizing the Queue-Overflow Probability
Abstract-- In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a...
V. J. Venkataramanan, Xiaojun Lin