Sciweavers

950 search results - page 83 / 190
» Modified global k
Sort
View
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
14 years 4 months ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid
GECCO
2005
Springer
103views Optimization» more  GECCO 2005»
14 years 3 months ago
Maximally rugged NK landscapes contain the highest peaks
NK models provide a family of tunably rugged fitness landscapes used in a wide range of evolutionary computation studies. It is well known that the average height of local optima...
Benjamin Skellett, Benjamin Cairns, Nicholas Geard...
SIAMCOMP
2000
161views more  SIAMCOMP 2000»
13 years 10 months ago
Application-Controlled Paging for a Shared Cache
We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to informa...
Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vi...
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
12 years 16 days ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
CODES
2001
IEEE
14 years 1 months ago
Hybrid global/local search strategies for dynamic voltage scaling in embedded multiprocessors
In this paper, we explore a hybrid global/local search optimization framework for dynamic voltage scaling in embedded multiprocessor systems. The problem is to find, for a multipr...
Neal K. Bambha, Shuvra S. Bhattacharyya, Jürg...