Sciweavers

1095 search results - page 195 / 219
» Preprocessing of Intractable Problems
Sort
View
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
13 years 12 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
ECP
1997
Springer
103views Robotics» more  ECP 1997»
13 years 12 months ago
Plan-Refinement Strategies and Search-Space Size
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
Reiko Tsuneto, Dana S. Nau, James A. Hendler
ATAL
2008
Springer
13 years 9 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
ATAL
2008
Springer
13 years 9 months ago
Evolutionary dynamics for designing multi-period auctions
Mechanism design (MD) has recently become a very popular approach in the design of distributed systems of autonomous agents. A key assumption required for the application of MD is...
Tomas Klos, Gerrit Jan van Ahee
IJCAI
2007
13 years 9 months ago
Learning to Walk through Imitation
Programming a humanoid robot to walk is a challenging problem in robotics. Traditional approaches rely heavily on prior knowledge of the robot's physical parameters to devise...
Rawichote Chalodhorn, David B. Grimes, Keith Groch...