61 search results - page 5 / 13 » Exploiting Partial Operand Knowledge |
112
click to vote
ATAL
2010
Springer
14 years 12 months ago
2010
Springer
PAC-MDP algorithms approach the exploration-exploitation problem of reinforcement learning agents in an effective way which guarantees that with high probability, the algorithm pe...
101
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Bottom-up segmentation tends to rely on local features. Yet, many natural and man-made objects contain repeating elements. Such structural and more spread-out features are importa...
105
click to vote
JCM
2010
14 years 10 months ago
2010
— This paper presents a resource-efficient protocol for opportunistic routing in delay-tolerant networks (DTN). First, our approach exploits the context of mobile nodes (speed, ...
97
Voted
MATES
2005
Springer
15 years 5 months ago
2005
Springer
Knowledge sharing in a virtual organization requires a knowledge life cycle including knowledge provisioning, terminology alignment, determination of resource location, query routi...
ESWS
2008
Springer
15 years 1 months ago
2008
Springer
This paper concerns versioning services over Semantic Web (SW) repositories. We propose a novel storage index (based on partial orders), called POI, that exploits the fact that RDF...