Results 21 to 30 of about 7,082,722 (377)
Acknowledgement to Reviewers of Algorithms in 2013
Algorithms, 2014 The editors of Algorithms would like to express their sincere gratitude to the following reviewers for assessing manuscripts in 2013.
Algorithms Editorial Office
doaj +1 more source
npj Systems Biology and Applications, 2021 The utility of pathway signatures lies in their capability to determine whether a specific pathway or biological process is dysregulated in a given patient.
Sepehr Golriz Khatami +5 more
doaj +1 more source
Acknowledgement to Reviewers of Algorithms in 2018
Algorithms, 2019 Rigorous peer-review is the corner-stone of high-quality academic publishing [...]
Algorithms Editorial Office
doaj +1 more source
, 2020 sets of environments and policies respectively and ` : E ×Π→ [0, 1] a bounded loss function. Given a policy π let `(π) = (`(ν1, π), . . . , `(νN , π)) be the loss vector resulting from policy π.
Tor Lattimore, Csaba Szepesvari
semanticscholar +1 more source
Acknowledgement to Reviewers of Algorithms in 2014
Algorithms, 2015 The editors of Algorithms would like to express their sincere gratitude to the following reviewers for assessing manuscripts in 2014:[...]
Algorithms Editorial Office
doaj +1 more source
On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 We exhibit a recurrence on the number of discrete line segments joining two integer points in the plane using an encoding of such segments as balanced words of given length and height over the two-letter alphabet $\{0,1\}$.
Nicolas Bédaride +3 more
doaj +1 more source
Systematic Biology, 2010 PhyML is a phylogeny software based on the maximum-likelihood principle. Early PhyML versions used a fast algorithm performing nearest neighbor interchanges to improve a reasonable starting tree topology.
Stéphane Guindon +5 more
semanticscholar +1 more source
Acknowledgement to Reviewers of Algorithms in 2015
Algorithms, 2016 The editors of Algorithms would like to express their sincere gratitude to the following reviewers for assessing manuscripts in 2015. [...]
Algorithms Editorial Office
doaj +1 more source
Constrained ear decompositions in graphs and digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Ear decompositions of graphs are a standard concept related to several major problems in graph theory like the Traveling Salesman Problem. For example, the Hamiltonian Cycle Problem, which is notoriously N P-complete, is equivalent to deciding whether a ...
Frédéric Havet, Nicolas Nisse
doaj +1 more source
Acknowledgement to Reviewers of Algorithms in 2016
Algorithms, 2017 The editors of Algorithms would like to express their sincere gratitude to the following reviewers for assessing manuscripts in 2016.[...]
Algorithms Editorial Office
doaj +1 more source