1302 search results - page 42 / 261 » Fair Equivalence Relations |
187
Voted
ATAL
2008
Springer
15 years 7 months ago
2008
Springer
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorit...
166
click to vote
INFOCOM
2002
IEEE
15 years 10 months ago
2002
IEEE
— For wireless cellular and ad hoc networks with QoS constraints, we propose a suite of problem formulations that allocate network resources to optimize SIR, maximize throughput ...
147
click to vote
COMCOM
2010
15 years 4 months ago
2010
—In this paper, we study the trade-off between network throughput and fairness in a multi-channel enabled WSN. Traditional approaches attempt to solve the two problems in an isol...
150
click to vote
INFOCOM
2009
IEEE
16 years 7 days ago
2009
IEEE
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
146
click to vote
SIGSOFT
2009
ACM
16 years 6 months ago
2009
ACM
Software engineering researchers have long been interested in where and why bugs occur in code, and in predicting where they might turn up next. Historical bug-occurence data has ...