Sciweavers

241 search results - page 15 / 49
» Four Paths to AI
Sort
View
BMCBI
2007
143views more  BMCBI 2007»
13 years 7 months ago
RNAspa: a shortest path approach for comparative prediction of the secondary structure of ncRNA molecules
Background: In recent years, RNA molecules that are not translated into proteins (ncRNAs) have drawn a great deal of attention, as they were shown to be involved in many cellular ...
Yair Horesh, Tirza Doniger, Shulamit Michaeli, Ron...
CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 6 months ago
Realizable Paths and the NL vs L Problem
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
Shiva Kintali
AINA
2008
IEEE
14 years 2 months ago
Fairness of High-Speed TCP Stacks
We present experimental results evaluating fairness of several proposals to change the TCP congestion control algorithm, in support of operation on high bandwidth-delayproduct (BD...
Dimitrios Miras, Martin Bateman, Saleem N. Bhatti
JCO
2007
130views more  JCO 2007»
13 years 7 months ago
On edge orienting methods for graph coloring
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
Bernard Gendron, Alain Hertz, Patrick St-Louis
CORR
2010
Springer
83views Education» more  CORR 2010»
13 years 6 months ago
Flat Zipper-Unfolding Pairs for Platonic Solids
We show that four of the five Platonic solids’ surfaces may be cut open with a Hamiltonian path along edges and unfolded to a polygonal net each of which can “zipper-refold...
Joseph O'Rourke