3146 search results - page 366 / 630 » Efficient Consequence Finding |
119
click to vote
CONEXT
2008
ACM
15 years 6 months ago
2008
ACM
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
146
click to vote
SDM
2010
SIAM
15 years 5 months ago
2010
SIAM
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
138
click to vote
RIVF
2007
15 years 5 months ago
2007
— This paper is at the crossroad of Cognitive Psychology and AI Robotics. It reports a cross-disciplinary project concerned about implementing human heuristics within autonomous ...
133
click to vote
AAAI
2006
15 years 5 months ago
2006
We present a new algorithm, called incremental least squares policy iteration (ILSPI), for finding the infinite-horizon stationary policy for partially observable Markov decision ...
155
click to vote
AAAI
2006
15 years 5 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...