Sciweavers

1278 search results - page 179 / 256
» Design and Analysis of Parametric Query Optimization Algorit...
Sort
View
CIKM
2010
Springer
14 years 7 months ago
Utilizing re-finding for personalized information retrieval
Individuals often use search engines to return to web pages they have previously visited. This behaviour, called refinding, accounts for about 38% of all queries. While researcher...
Sarah K. Tyler, Jian Wang, Yi Zhang 0001
ASPDAC
2009
ACM
115views Hardware» more  ASPDAC 2009»
15 years 4 months ago
Incremental and on-demand random walk for iterative power distribution network analysis
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
Yiyu Shi, Wei Yao, Jinjun Xiong, Lei He
JCO
2011
115views more  JCO 2011»
14 years 4 months ago
Approximation scheme for restricted discrete gate sizing targeting delay minimization
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
Chen Liao, Shiyan Hu
GLOBECOM
2007
IEEE
15 years 4 months ago
Clustered K-Center: Effective Replica Placement in Peer-to-Peer Systems
Abstract— Peer-to-Peer (P2P) systems provide decentralization, self-organization, scalability and failure-resilience, but suffer from high worst-case latencies. Researchers have ...
Jian Zhou, Xin Zhang, Laxmi N. Bhuyan, Bin Liu
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
15 years 3 months ago
Informative performance metrics for dynamic optimisation problems
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
Stefan Bird, Xiaodong Li