1941 search results - page 177 / 389 » On the Hardness of Approximate Reasoning |
273
click to vote
GIS
2008
ACM
16 years 7 months ago
2008
ACM
Road network data is often incomplete, making it hard to perform network analysis. This paper discusses the problem of extending partial road networks with reasonable links, using...
152
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
As an increasingly large number of OWL ontologies become available on the Semantic Web and the descriptions in the ontologies become more complicated, finding the cause of errors ...
165
click to vote
CHI
2009
ACM
16 years 1 months ago
2009
ACM
Authentication in public spaces is a risky task. Frauds on cash machines (ATMs) are not uncommon nowadays. The biggest group of attacks is observation attacks, which focus on reco...
153
click to vote
IAT
2007
IEEE
16 years 25 days ago
2007
IEEE
Privacy is often cited as the main reason to adopt a multiagent approach for a certain problem. This also holds true for multiagent planning. Still, papers on multiagent planning ...
171
click to vote
CSL
2007
Springer
16 years 21 days ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...