AAAI
2012
12 years 2 months ago
2012
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...
INFOCOM
2011
IEEE
13 years 3 months ago
2011
IEEE
—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...
RTAS
2011
IEEE
13 years 4 months ago
2011
IEEE
— 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...
TCS
2011
13 years 7 months ago
2011
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...
GECCO
2010
Springer
14 years 3 months ago
2010
Springer
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...
COMPGEOM
2001
ACM
14 years 4 months ago
2001
ACM
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...
WADS
1993
Springer
14 years 4 months ago
1993
Springer
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 ...
SWAT
1994
Springer
14 years 4 months ago
1994
Springer
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...
ESA
1997
Springer
14 years 4 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
ICPP
2003
IEEE
14 years 5 months ago
2003
IEEE
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 − ...