1450 search results - page 155 / 290 » On the Complexity of Hardness Amplification |
MODELS
2007
Springer
14 years 3 months ago
2007
Springer
Recently, the complexity of modern, real-time computer games has increased drastically. The need for sophisticated game AI, in particular for Non-Player Characters, grows with the ...
STACS
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
WABI
2007
Springer
14 years 3 months ago
2007
Springer
In this paper we introduce a new method of combined synthesis and inference of biological signal transduction networks. A main idea of our method lies in representing observed cau...
WABI
2007
Springer
14 years 3 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
AGILEDC
2006
IEEE
14 years 3 months ago
2006
IEEE
There is a class of projects that can only be accomplished via agile practices due to their complexity and risks. It is rare for such a project to be staffed with newbies but it h...