1772 search results - page 99 / 355 » Classifying Problems into Complexity Classes |
145
Voted
MFCS
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
140
Voted
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
124
Voted
CAD
2000
Springer
15 years 2 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
131
Voted
TIP
2008
15 years 2 months ago
2008
In this paper, a novel method for reducing the runtime complexity of a support vector machine classifier is presented. The new training algorithm is fast and simple. This is achiev...
122
Voted
ESOP
2009
Springer
15 years 6 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...