10106 search results - page 470 / 2022 » Algorithm Selection and Scheduling |
208
click to vote
INFOCOM
2009
IEEE
16 years 2 months ago
2009
IEEE
—We study throughput-optimal scheduling/routing over mobile ad-hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiu...
194
click to vote
ICALP
2004
Springer
16 years 29 days ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
230
click to vote
KDD
2004
ACM
16 years 8 months ago
2004
ACM
We present and empirically analyze a machine-learning approach for detecting intrusions on individual computers. Our Winnowbased algorithm continually monitors user and system beh...
321
Voted
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
220
click to vote
EDBT
2009
ACM
16 years 2 months ago
2009
ACM
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...