13603 search results - page 399 / 2721 » On the Complexity of Computing Treelength |
198
click to vote
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
Cooperative approaches have proved to be very useful in evolutionary computation due to their ability to solve efficiently high-dimensional complex problems through the cooperatio...
191
click to vote
ECCC
2000
15 years 7 months ago
2000
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...
139
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
B This paper examinesthe integration of computational complexity into gametheoretic models. Theexample focused on is the Prisoner’s Dilemma,repeated for a finite length of time....
154
click to vote
MOC
1998
15 years 7 months ago
1998
Rutishauser, Gragg and Harrod and finally H.Y. Zha used the same class of chasing algorithms for transforming arrowhead matrices to tridiagonal form. Using a graphical theoretical...
195
click to vote
FOCS
2010
IEEE
15 years 5 months ago
2010
IEEE
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...