Sciweavers

614 search results - page 106 / 123
» Local Computation: Lower and Upper Bounds
Sort
View
EUROCOLT
1997
Springer
14 years 1 months ago
Vapnik-Chervonenkis Dimension of Recurrent Neural Networks
Most of the work on the Vapnik-Chervonenkis dimension of neural networks has been focused on feedforward networks. However, recurrent networks are also widely used in learning app...
Pascal Koiran, Eduardo D. Sontag
MOBICOM
2003
ACM
14 years 3 months ago
Topology control for wireless sensor networks
We consider a two-tiered Wireless Sensor Network (WSN) consisting of sensor clusters deployed around strategic locations and base-stations (BSs) whose locations are relatively fl...
Jianping Pan, Yiwei Thomas Hou, Lin Cai, Yi Shi, S...
AIPS
2010
14 years 2 days ago
When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
Emma Brunskill
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 9 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr
HPDC
2005
IEEE
14 years 3 months ago
GWiQ-P: an efficient decentralized grid-wide quota enforcement protocol
Mega grids span several continents and may consist of millions of nodes and billions of tasks executing at any point in time. This setup calls for scalable and highly available re...
Kfir Karmon, Liran Liss, Assaf Schuster