Sciweavers

16596 search results - page 430 / 3320
» Generalized Assignment Problems
Sort
View
HICSS
2009
IEEE
85views Biometrics» more  HICSS 2009»
16 years 2 months ago
Bounding the Size of k-Tuple Covers
Suppose there are n applications and n processors. A pair cover is a set S of one-to-one mappings (assignments) of the applications to the processors such that, for every pair (Ai...
Wolfgang W. Bein, Shahram Latifi, Linda Morales, I...
ITICSE
2009
ACM
16 years 2 months ago
The use of a controlled wireless testbed in courses
Wireless networking has become a popular topic in both undergraduate and graduate courses. However, putting together good assignments in wireless networking is difficult because t...
Peter Steenkiste
SIGIR
2009
ACM
16 years 2 months ago
Using wikipedia categories for ad hoc search
In this paper we explore the use of category information for ad hoc retrieval in Wikipedia. We show that techniques for entity ranking exploiting this category information can als...
Rianne Kaptein, Marijn Koolen, Jaap Kamps
CIDM
2007
IEEE
16 years 1 months ago
iScore: Measuring the Interestingness of Articles in a Limited User Environment
Abstract-Search engines, such as Google, assign scores to news articles based on their relevancy to a query. However, not all relevant articles for the query may be interesting to ...
Raymond K. Pon, Alfonso F. Cardenas, David Buttler...
PODC
2004
ACM
16 years 1 months ago
Load balancing and locality in range-queriable data structures
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing wit...
James Aspnes, Jonathan Kirsch, Arvind Krishnamurth...