Sciweavers

420 search results - page 8 / 84
» Finding an Optimal Inversion Median: Experimental Results
Sort
View
GECCO
2006
Springer
175views Optimization» more  GECCO 2006»
14 years 7 days ago
An ant-based algorithm for finding degree-constrained minimum spanning tree
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
Thang Nguyen Bui, Catherine M. Zrncic
ASPLOS
2006
ACM
14 years 9 days ago
Accurate and efficient regression modeling for microarchitectural performance and power prediction
We propose regression modeling as an efficient approach for accurately predicting performance and power for various applications executing on any microprocessor configuration in a...
Benjamin C. Lee, David M. Brooks
WWW
2009
ACM
14 years 9 months ago
Quicklink selection for navigational query results
Quicklinks for a website are navigational shortcuts displayed below the website homepage on a search results page, and that let the users directly jump to selected points inside t...
Deepayan Chakrabarti, Ravi Kumar, Kunal Punera
GECCO
2006
Springer
172views Optimization» more  GECCO 2006»
14 years 7 days ago
Evolving boolean networks to find intervention points in dengue pathogenesis
We use probabilistic boolean networks to simulate the pathogenesis of Dengue Hemorraghic Fever (DHF). Based on Chaturvedi's work, the strength of cytokine influences are mode...
Philip Tan, Joc Cing Tay
WWW
2008
ACM
14 years 9 months ago
Finding core members in virtual communities
Finding the core members of a virtual community is an important problem in community analysis. Here we presented an simulated annealing algorithm to solve this problem by optimizi...
Haiqiang Chen, Xueqi Cheng, Yue Liu