Sciweavers

4797 search results - page 214 / 960
» The complexity of partition tasks
Sort
View
NIPS
1994
15 years 7 months ago
Finding Structure in Reinforcement Learning
Reinforcement learning addresses the problem of learning to select actions in order to maximize one's performance inunknownenvironments. Toscale reinforcement learning to com...
Sebastian Thrun, Anton Schwartz
GI
2010
Springer
15 years 5 months ago
Comparing Similarity Combination Methods for Schema Matching
: A recurring manual task in data integration or ontology alignment is finding mappings between complex schemas. In order to reduce the manual effort, many matching algorithms for ...
Eric Peukert, Sabine Maßmann, Kathleen K&oum...
CDC
2010
IEEE
186views Control Systems» more  CDC 2010»
15 years 1 months ago
Contact based robot control through tactile maps
This paper deals with the problem of controlling a robot during a physical interaction through a representation of its tactile system. Although the force feedback has been widely u...
Giorgio Cannata, Simone Denei, Fulvio Mastrogiovan...
CIKM
2011
Springer
14 years 6 months ago
Block-based load balancing for entity resolution with MapReduce
The effectiveness and scalability of MapReduce-based implementations of complex data-intensive tasks depend on an even redistribution of data between map and reduce tasks. In the...
Lars Kolb, Andreas Thor, Erhard Rahm
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
16 years 7 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...