Sciweavers

3422 search results - page 501 / 685
» Random Subset Optimization
Sort
View
PRICAI
2004
Springer
15 years 8 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
130
Voted
PODC
1999
ACM
15 years 7 months ago
Memory Space Requirements for Self-Stabilizing Leader Election Protocols
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We...
Joffroy Beauquier, Maria Gradinariu, Colette Johne...
APNOMS
2006
Springer
15 years 7 months ago
An Enhanced RED-Based Scheme for Differentiated Loss Guarantees
Abstract. Recently, researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The Bounded Random Drop (BRD), known...
Jahwan Koo, Vladimir V. Shakhov, Hyunseung Choo
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
15 years 4 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
WSC
2004
15 years 4 months ago
A Case Study in Meta-Simulation Design and Performance Analysis for Large-Scale Networks
Simulation and Emulation techniques are fundamental to aid the process of large-scale protocol design and network operations. However, the results from these techniques are often ...
David W. Bauer, Garrett R. Yaun, Christopher D. Ca...