Sciweavers

475 search results - page 15 / 95
» TSSP: A Reinforcement Algorithm to Find Related Papers
Sort
View
PREMI
2011
Springer
12 years 10 months ago
Finding Potential Seeds through Rank Aggregation of Web Searches
This paper presents a potential seed selection algorithm for web crawlers using a gain - share scoring approach. Initially we consider a set of arbitrarily chosen tourism queries. ...
Rajendra Prasath, Pinar Öztürk
ICDM
2002
IEEE
148views Data Mining» more  ICDM 2002»
14 years 13 days ago
SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
Masakazu Seno, George Karypis
ICLP
1999
Springer
13 years 11 months ago
Finding Fair Allocations for the Coalition Problem with Constraints
Fair allocation of payoffs among cooperating players who can form various coalitions of differing utilities is the classic game theoretic “coalition problem.” Shapley’s va...
Evan Tick, Roland H. C. Yap, Michael J. Maher
ICRA
2005
IEEE
140views Robotics» more  ICRA 2005»
14 years 1 months ago
Fast Reinforcement Learning for Vision-guided Mobile Robots
— This paper presents a new reinforcement learning algorithm for accelerating acquisition of new skills by real mobile robots, without requiring simulation. It speeds up Q-learni...
Tomás Martínez-Marín, Tom Duc...
IJCAI
2007
13 years 9 months ago
Some Effects of a Reduced Relational Vocabulary on the Whodunit Problem
A key issue in artificial intelligence lies in finding the amount of input detail needed to do successful learning. Too much detail causes overhead and makes learning prone to ove...
Daniel T. Halstead, Kenneth D. Forbus