10988 search results - page 1726 / 2198 » Algorithmic Folding Complexity |
159
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Coverage is a fundamental problem in Wireless Sensor Networks (WSNs). Existing studies on this topic focus on 2D ideal plane coverage and 3D full space coverage. In many real wo...
203
Voted
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
156
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
179
click to vote
CPM
2009
Springer
16 years 1 months ago
2009
Springer
The haplotype inference problem (HIP) asks to find a set of haplotypes which resolve a given set of genotypes. This problem is of enormous importance in many practical fields, su...
170
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...