Sciweavers

274 search results - page 25 / 55
» Dynamic Cluster Assignment Mechanisms
Sort
View
PDP
2008
IEEE
14 years 1 months ago
Load Balancing Distributed Inverted Files: Query Ranking
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
Carlos Gomez-Pantoja, Mauricio Marín
INFOCOM
2002
IEEE
14 years 9 days ago
Maxmin fair scheduling in wireless networks
—We consider scheduling policies for maxmin fair allocation of bandwidth in wireless adhoc networks. We formalize the maxmin fair objective under wireless scheduling constraints....
Leandros Tassiulas, Saswati Sarkar
ENDM
2006
77views more  ENDM 2006»
13 years 7 months ago
A Two-stage Model for a Day-ahead Paratransit Planning Problem
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...
Maria L. A. G. Cremers, Willem K. Klein Haneveld, ...
CORR
2008
Springer
154views Education» more  CORR 2008»
13 years 7 months ago
Sponsored Search Auctions with Markovian Users
Abstract. Sponsored search involves running an auction among advertisers who bid in order to have their ad shown next to search results for specific keywords. The most popular auct...
Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Mar...
BMCBI
2007
152views more  BMCBI 2007»
13 years 7 months ago
Difference-based clustering of short time-course microarray data with replicates
Background: There are some limitations associated with conventional clustering methods for short time-course gene expression data. The current algorithms require prior domain know...
Jihoon Kim, Ju Han Kim