7167 search results - page 672 / 1434 » Answer Set Programming |
226
click to vote
ACML
2009
Springer
15 years 11 months ago
2009
Springer
A fundamental assumption for any machine learning task is to have training and test data instances drawn from the same distribution while having a sufficiently large number of tra...
187
click to vote
CONCUR
2001
Springer
15 years 11 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
165
Voted
ESA
2001
Springer
15 years 11 months ago
2001
Springer
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults. Concerning oblivious fault-tolerant dist...
136
click to vote
SEMWEB
2001
Springer
15 years 11 months ago
2001
Springer
Querying the Web today can be a frustrating activity because the results delivered by syntactically oriented search engines often do not match the intentions of the user. The DARP...
180
click to vote
SIGGRAPH
2000
ACM
15 years 11 months ago
2000
ACM
Visibility determination is a key requirement in a wide range of graphics algorithms. This paper introduces a new approach to the computation of volume visibility, the detection o...