2313 search results - page 390 / 463 » On Heuristic Time Hierarchies |
180
click to vote
MST
2010
15 years 4 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
196
click to vote
TPDS
2010
15 years 4 months ago
2010
—We consider an end-to-end approach of inferring probabilistic data-forwarding failures in an externally managed overlay network, where overlay nodes are independently operated b...
253
click to vote
WABI
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present three heuristic strategies for folding RNA sequences into secondary structures including kissing hairpin motifs. The new idea is to construct a kissing hairpin...
163
click to vote
WINET
2010
15 years 4 months ago
2010
Broadcasting is an efficient and scalable way of transmitting data over wireless channels to an unlimited number of clients. In this paper the problem of allocating data to multip...
186
click to vote
4OR
2010
15 years 4 months ago
2010
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...