Sciweavers

625 search results - page 69 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
135
Voted
PODC
2000
ACM
15 years 7 months ago
Efficient atomic broadcast using deterministic merge
We present an approach for merging message streams from producers distributed over a network, using a deterministic algorithm that is independent of any nondeterminism of the syst...
Marcos Kawazoe Aguilera, Robert E. Strom
ESANN
2007
15 years 4 months ago
The Recurrent Control Neural Network
This paper presents our Recurrent Control Neural Network (RCNN), which is a model-based approach for a data-efficient modelling and control of reinforcement learning problems in di...
Anton Maximilian Schäfer, Steffen Udluft, Han...
INFOCOM
2010
IEEE
15 years 1 months ago
Resource Allocation over Network Dynamics without Timescale Separation
—We consider a widely applicable model of resource allocation where two sequences of events are coupled: on a continuous time axis (t), network dynamics evolve over time. On a di...
Alexandre Proutiere, Yung Yi, Tian Lan, Mung Chian...
FOCS
1997
IEEE
15 years 7 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
AIA
2007
15 years 4 months ago
Adaptive preference elicitation for top-K recommendation tasks using GAI-networks
The enormous number of questions needed to acquire a full preference model when the size of the outcome space is large forces us to work with partial models that approximate the u...
Sérgio R. de M. Queiroz