Sciweavers

2252 search results - page 228 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
16 years 1 months ago
Data-Specific Analysis of String Sorting
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
Raimund Seidel
CCECE
2006
IEEE
15 years 10 months ago
New Constraints on Generation of Uniform Random Samples from Evolutionary Trees
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
Anupam Bhattacharjee, Zalia Shams, Kazi Zakia Sult...
CG
2006
Springer
15 years 7 months ago
A Skat Player Based on Monte-Carlo Simulation
We apply Monte Carlo simulation and alpha-beta search to the card game of Skat, which is similar to Bridge, but different enough to require some new algorithmic ideas besides the t...
Sebastian Kupferschmid, Malte Helmert
CODES
2007
IEEE
15 years 7 months ago
Energy efficient co-scheduling in dynamically reconfigurable systems
Energy consumption is a major issue in dynamically reconfigurable systems because of the high power requirements during repeated configurations. Hardware designs employ low power ...
Pao-Ann Hsiung, Pin-Hsien Lu, Chih-Wen Liu
SIGMOD
2012
ACM
242views Database» more  SIGMOD 2012»
13 years 6 months ago
Dynamic management of resources and workloads for RDBMS in cloud: a control-theoretic approach
As cloud computing environments become explosively popular, dealing with unpredictable changes, uncertainties, and disturbances in both systems and environments turns out to be on...
Pengcheng Xiong