Sciweavers

540 search results - page 68 / 108
» Competitive Routing over Time
Sort
View
INFOCOM
2007
IEEE
14 years 4 months ago
A Graph-Based Model for Disconnected Ad Hoc Networks
— Recently, research on disconnected networks has been fostered by several studies on delay-tolerant networks, which are designed in order to sustain disconnected operations. We ...
Francesco De Pellegrini, Daniele Miorandi, Iacopo ...
SAGA
2009
Springer
14 years 4 months ago
Economical Caching with Stochastic Prices
In the economical caching problem, an online algorithm is given a sequence of prices for a certain commodity. The algorithm has to manage a buffer of fixed capacity over time. We...
Matthias Englert, Berthold Vöcking, Melanie W...
ISAAC
2001
Springer
116views Algorithms» more  ISAAC 2001»
14 years 2 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
ESWA
2008
187views more  ESWA 2008»
13 years 9 months ago
A DEA window analysis on the product family mix selection for a semiconductor fabricator
In a competitive market, semiconductor fabricator must face an environment with multi-product types, multi-priority orders and demand changes in time. Since semiconductor fabricat...
Shu-Hsing Chung, Amy Hsin-I Lee, He-Yau Kang, Chih...
ICML
1999
IEEE
14 years 11 months ago
The Alternating Decision Tree Learning Algorithm
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
Yoav Freund, Llew Mason