8496 search results - page 208 / 1700 » Problem Solving and Complex Systems |
113
click to vote
CORR
2010
Springer
15 years 26 days ago
2010
Springer
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...
130
Voted
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
114
Voted
LISA
2007
15 years 4 months ago
2007
Problem determination remains one of the most expensive and time-consuming functions in system management due to the difficulty in automating what is essentially a highly experien...
136
click to vote
JCC
2006
15 years 2 months ago
2006
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
97
Voted
CCA
2009
Springer
15 years 9 months ago
2009
Springer
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...