Sciweavers

12 search results - page 2 / 3
» BubbleSearch: A simple heuristic for improving priority-base...
Sort
View
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
13 years 10 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
CEC
2007
IEEE
13 years 9 months ago
Efficient assembling of genome fragments using genetic algorithm enhanced by heuristic search
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
Satoko Kikuchi, Goutam Chakraborty
HEURISTICS
2008
92views more  HEURISTICS 2008»
13 years 5 months ago
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
Abid M. Malik, Tyrel Russell, Michael Chase, Peter...
RECOMB
2010
Springer
13 years 7 months ago
Subnetwork State Functions Define Dysregulated Subnetworks in Cancer
Abstract. Emerging research demonstrates the potential of proteinprotein interaction (PPI) networks in uncovering the mechanistic bases of cancers, through identification of intera...
Salim A. Chowdhury, Rod K. Nibbe, Mark R. Chance, ...
KDD
2010
ACM
265views Data Mining» more  KDD 2010»
13 years 7 months ago
Scalable influence maximization for prevalent viral marketing in large-scale social networks
Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influe...
Wei Chen, Chi Wang, Yajun Wang