Sciweavers

9842 search results - page 1946 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
PODC
2005
ACM
14 years 1 months ago
Stochastic analysis of distributed deadlock scheduling
Deadlock detection scheduling is an important, yet oft-overlooked problem that can significantly affect the overall performance of deadlock handling. An excessive initiation of ...
Shigang Chen, Yibei Ling
SENSYS
2005
ACM
14 years 1 months ago
Intelligent light control using sensor networks
Increasing user comfort and reducing operation costs have always been two primary objectives of building operations and control strategies. Current building control strategies are...
Vipul Singhvi, Andreas Krause, Carlos Guestrin, Ja...
SIGECOM
2005
ACM
169views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Online auctions with re-usable goods
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mo...
SIGIR
2005
ACM
14 years 1 months ago
Title extraction from bodies of HTML documents and its application to web page retrieval
This paper is concerned with automatic extraction of titles from the bodies of HTML documents. Titles of HTML documents should be correctly defined in the title fields; however, i...
Yunhua Hu, Guomao Xin, Ruihua Song, Guoping Hu, Sh...
SIGMETRICS
2005
ACM
118views Hardware» more  SIGMETRICS 2005»
14 years 1 months ago
Nearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
Adam Wierman, Mor Harchol-Balter, Takayuki Osogami
« Prev « First page 1946 / 1969 Last » Next »