Sciweavers

5214 search results - page 112 / 1043
» The Online Specialization Problem
Sort
View
SIGECOM
2004
ACM
165views ECommerce» more  SIGECOM 2004»
14 years 2 months ago
Adaptive limited-supply online auctions
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Da...
SPAA
2004
ACM
14 years 2 months ago
Online algorithms for prefetching and caching on parallel disks
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter
SPAA
2004
ACM
14 years 2 months ago
Online hierarchical cooperative caching
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun V...
ACSW
2004
13 years 10 months ago
Applying Online Gradient Descent Search to Genetic Programming for Object Recognition
This paper describes an approach to the use of gradient descent search in genetic programming (GP) for object classification problems. In this approach, pixel statistics are used ...
William D. Smart, Mengjie Zhang
MST
2002
107views more  MST 2002»
13 years 8 months ago
Efficient On-Line Frequency Allocation and Call Control in Cellular Networks
Abstract. In this paper we consider communication issues arising in cellular (mobile) networks that utilize frequency division multiplexing (FDM) technology. In such networks, many...
Ioannis Caragiannis, Christos Kaklamanis, Evi Papa...