Sciweavers

416 search results - page 77 / 84
» Approximation Algorithms for Reliable Stochastic Combinatori...
Sort
View
ICML
1996
IEEE
16 years 13 days ago
Learning Evaluation Functions for Large Acyclic Domains
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
Justin A. Boyan, Andrew W. Moore
COMSWARE
2007
IEEE
15 years 3 months ago
On Configuring BGP Route Reflectors
The Border Gateway Protocol (BGP) is the standard protocol for exchanging routing information between border routers of Autonomous Systems (ASes) in today's Internet. Within a...
Yuri Breitbart, Minos N. Garofalakis, Anupam Gupta...
103
Voted
ATAL
2010
Springer
15 years 22 days ago
Quasi deterministic POMDPs and DecPOMDPs
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
Camille Besse, Brahim Chaib-draa
107
Voted
TRANSCI
2010
128views more  TRANSCI 2010»
14 years 10 months ago
An Information-Theoretic Sensor Location Model for Traffic Origin-Destination Demand Estimation Applications
To design a transportation sensor network, the decision-maker needs to determine what sensor investments should be made, as well as when, how, where and with what technologies. Th...
Xuesong Zhou, George F. List
FOCI
2007
IEEE
15 years 6 months ago
Almost All Learning Machines are Singular
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
Sumio Watanabe