2661 search results - page 174 / 533 » Quantum Complexity Classes |
131
Voted
ATAL
2003
Springer
15 years 8 months ago
2003
Springer
There has been substantial progress with formal models for sequential decision making by individual agents using the Markov decision process (MDP). However, similar treatment of m...
133
Voted
APAL
2007
15 years 3 months ago
2007
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
125
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Software engineering activities in the Industry has come a long way with various improvements brought in various stages of the software development life cycle. The comple...
151
click to vote
ISB
2002
15 years 3 months ago
2002
Data Mining and Knowledge Discovery techniques proved to be efficient tools for variety of complex tasks in biology including DNA research. This paper presents implementation of th...
122
Voted
TCS
1998
15 years 3 months ago
1998
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...