Sciweavers

5995 search results - page 865 / 1199
» Algorithmic Game Theory
Sort
View
CORR
2004
Springer
119views Education» more  CORR 2004»
15 years 6 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
CORR
2004
Springer
90views Education» more  CORR 2004»
15 years 6 months ago
Non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
KBS
2002
136views more  KBS 2002»
15 years 6 months ago
Diagnostic reasoning based on means-end models: experiences and future prospects
Multilevel Flow Models (MFM) are graphical models of goals and functions of technical systems. MFM was invented by Morten Lind at the Technical University of Denmark and several n...
Jan Eric Larsson
SIAMJO
2002
159views more  SIAMJO 2002»
15 years 6 months ago
Locating the Least 2-Norm Solution of Linear Programs via a Path-Following Method
A linear program has a unique least 2-norm solution provided that the linear program has a solution. To locate this solution, most of the existing methods were devised to solve cer...
Yun-Bin Zhao, Duan Li
TALG
2010
110views more  TALG 2010»
15 years 5 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx