Sciweavers

343 search results - page 7 / 69
» A Comparison of Online and Dynamic Impact Analysis Algorithm...
Sort
View
ALENEX
2008
133views Algorithms» more  ALENEX 2008»
13 years 9 months ago
Comparing Online Learning Algorithms to Stochastic Approaches for the Multi-Period Newsvendor Problem
The multi-period newsvendor problem describes the dilemma of a newspaper salesman--how many paper should he purchase each day to resell, when he doesn't know the demand? We d...
Shawn O'Neil, Amitabh Chaudhary
DSS
2008
114views more  DSS 2008»
13 years 7 months ago
Price formation and its dynamics in online auctions
This research uses functional data modelling to study the price formation process of online auctions. It conceptualizes the price curve and its first and second derivatives (veloc...
Ravi Bapna, Wolfgang Jank, Galit Shmueli
PE
2002
Springer
158views Optimization» more  PE 2002»
13 years 7 months ago
Comparison of inter-area rekeying algorithms for secure wireless group communications
Many emerging mobile wireless applications depend upon secure group communications, in which data is encrypted and the group's data encryption key is changed whenever a membe...
Chun Zhang, Brian DeCleene, James F. Kurose, Donal...
BROADNETS
2007
IEEE
14 years 1 months ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
COMCOM
2006
114views more  COMCOM 2006»
13 years 7 months ago
A comparison of epidemic algorithms in wireless sensor networks
We consider the problem of reliable data dissemination in the context of wireless sensor networks. For some application scenarios, reliable data dissemination to all nodes is nece...
Mert Akdere, Cemal Çagatay Bilgin, Ozan Ger...