Sciweavers

Share
AAAI
2012
8 years 2 months ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
INFOCOM
2011
IEEE
9 years 3 months ago
Optimal power control in Rayleigh-fading heterogeneous networks
—Heterogeneous wireless networks employ varying degrees of network coverage using power control in a multi-tier configuration, where low-power femtocells are used to enhance per...
Chee Wei Tan
RTAS
2011
IEEE
9 years 3 months ago
FPZL Schedulability Analysis
— This paper presents the Fixed Priority until Zero Laxity (FPZL) scheduling algorithm for multiprocessor realtime systems. FPZL is similar to global fixed priority preemptive sc...
Robert I. Davis, Alan Burns
TCS
2011
9 years 6 months ago
Dynamic normal forms and dynamic characteristic polynomial
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
Gudmund Skovbjerg Frandsen, Piotr Sankowski
GECCO
2010
Springer
249views Optimization» more  GECCO 2010»
10 years 3 months ago
Benchmarking a MOS-based algorithm on the BBOB-2010 noiseless function testbed
In this contribution, a hybrid algorithm combining Differential Evolution and IPOP-CMA-ES is presented and benchmarked on the BBOB 2010 noiseless testbed. The hybrid algorithm ha...
Antonio LaTorre, Santiago Muelas, José Mar&...
COMPGEOM
2001
ACM
10 years 3 months ago
A fully dynamic algorithm for planar
We show how to maintain the width of a set of n planar points subject to insertions and deletions of points in O( n log3 n) amortized time per update. Previously, no fully dynami...
Timothy M. Chan
WADS
1993
Springer
110views Algorithms» more  WADS 1993»
10 years 3 months ago
A Dynamic Separator Algorithm
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
Deganit Armon, John H. Reif
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
10 years 3 months ago
Lower Bounds for Dynamic Algorithms
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
Michael L. Fredman
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
10 years 4 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
ICPP
2003
IEEE
10 years 5 months ago
A Parallel Algorithm for Enumerating Combinations
In this paper we propose an efficient parallel algorithm with simple static and dynamic scheduling for generating combinations. It can use any number of processors (NP ≤ n − ...
Martha Torres, Alfredo Goldman, Junior Barrera
books