Sciweavers

2497 search results - page 204 / 500
» Requirements for models of achievable routing
Sort
View
WSC
2000
15 years 8 months ago
Simulation output analysis via dynamic batch means
This paper is focused on estimating the quality of the sample mean from a steady-state simulation experiment with consideration of computational efficiency, memory requirement, an...
Yingchieh Yeh, Bruce W. Schmeiser
ICML
2002
IEEE
16 years 7 months ago
Algorithm-Directed Exploration for Model-Based Reinforcement Learning in Factored MDPs
One of the central challenges in reinforcement learning is to balance the exploration/exploitation tradeoff while scaling up to large problems. Although model-based reinforcement ...
Carlos Guestrin, Relu Patrascu, Dale Schuurmans
DAC
2008
ACM
16 years 7 months ago
Automated transistor sizing for FPGA architecture exploration
The creation of an FPGA requires extensive transistor-level design. This is necessary for both the final design, and during architecture exploration, when many different logic and...
Ian Kuon, Jonathan Rose
PIMRC
2008
IEEE
16 years 29 days ago
A Distributed IP Mobility Approach for 3G SAE
—Future generations of mobile operator networks, based on an all-IP-based flat architecture and a multitude of different access technologies, require a proper IP-based mobility ...
Mathias Fischer, Frank-Uwe Andersen, Andreas K&oum...
COMSWARE
2007
IEEE
16 years 28 days ago
A Peer-to-Peer Scheme to Discover and Select QoS Enhanced Alternate Paths
— Increasing number of communication softwares are built on distributed architectures based on the Peer-toPeer (P2P) model, such as Skype [1], and PeerCast [2]. This model provid...
Thierry Rakotoarivelo, Patrick Sénac, Aruna...