6110 search results - page 233 / 1222 » Approximate Computing |
190
click to vote
CSL
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ļ...
195
click to vote
AAAI
2006
15 years 8 months ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
198
click to vote
NIPS
2004
15 years 8 months ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
159
click to vote
AUTOMATICA
2007
15 years 6 months ago
2007
In this paper, we deļ¬ne the notion of approximate bisimulation relation between two continuous systems. While exact bisimulation requires that the observations of two systems ar...
230
click to vote
ICALP
2005
Springer
16 years 2 days ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V ā N, the max-coloring problem seeks to ļ¬nd a proper vertex coloring of G whose color classes C1, C2, . . . ,...