Sciweavers

196 search results - page 11 / 40
» New Algorithms for Optimal Online Checkpointing
Sort
View
WWW
2008
ACM
14 years 8 months ago
First workshop on targeting and ranking for online advertising
Online advertising is a rapidly growing, multi-billion dollar industry. It has become a significant element of the Web browsing experience. Ad platforms used for ad selection use ...
Ewa Dominowska, Vanja Josifovski
EUSFLAT
2003
121views Fuzzy Logic» more  EUSFLAT 2003»
13 years 8 months ago
An adaptive learning algorithm for a neo fuzzy neuron
In the paper, a new optimal learning algorithm for a neo-fuzzy neuron (NFN) is proposed. The algorithm is characteristic in that it provides online tuning of not only the synaptic...
Yevgeniy Bodyanskiy, Illya Kokshenev, Vitaliy Kolo...
SPAA
2003
ACM
14 years 19 days ago
Online oblivious routing
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...
INFOCOM
2011
IEEE
12 years 11 months ago
Optimizing network-coded cooperative communications via joint session grouping and relay node selection
Abstract—Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechan...
Sushant Sharma, Yi Shi, Y. Thomas Hou, Hanif D. Sh...
ISAAC
2001
Springer
116views Algorithms» more  ISAAC 2001»
13 years 11 months ago
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminat...
Hisashi Koga