Sciweavers

34 search results - page 5 / 7
» When and Why Ruppert's Algorithm Works
Sort
View
VLDB
1997
ACM
126views Database» more  VLDB 1997»
13 years 11 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
COMPLEX
2009
Springer
14 years 2 months ago
Exploring and Understanding Scientific Metrics in Citation Networks
This paper explores scientific metrics in citation networks in scientific communities, how they differ in ranking papers and authors, and why. In particular we focus on network eff...
Mikalai Krapivin, Maurizio Marchese, Fabio Casati
AAAI
2007
13 years 9 months ago
Search Space Reduction and Russian Doll Search
In a constraint optimization problem (COP), many feasible valuations lead to the same objective value. This often means a huge search space and poor performance in the propagation...
Kenil C. K. Cheng, Roland H. C. Yap
LION
2007
Springer
198views Optimization» more  LION 2007»
14 years 1 months ago
Multiobjective Landscape Analysis and the Generalized Assignment Problem
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective prob...
Deon Garrett, Dipankar Dasgupta
SIGMETRICS
2008
ACM
150views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Performance of random medium access control, an asymptotic approach
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
Charles Bordenave, David McDonald, Alexandre Prout...