Sciweavers

400 search results - page 56 / 80
» Derandomization and Distinguishing Complexity
Sort
View
AIEDU
2005
106views more  AIEDU 2005»
15 years 1 months ago
A Comparison of Model-Tracing and Constraint-Based Intelligent Tutoring Paradigms
Two approaches to building intelligent tutoring systems are the well-established model-tracing paradigm and the relatively newer constraint-based paradigm. Proponents of the constr...
Viswanathan Kodaganallur, Rob R. Weitz, David Rose...
TALG
2008
97views more  TALG 2008»
15 years 1 months ago
On an infinite family of solvable Hanoi graphs
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
Dany Azriel, Noam Solomon, Shay Solomon
ANOR
2005
93views more  ANOR 2005»
15 years 1 months ago
Looking Ahead with the Pilot Method
The pilot method as a meta-heuristic is a tempered greedy method aimed at obtaining better solutions while avoiding the greedy trap by looking ahead for each possible choice. Repea...
Stefan Voß, Andreas Fink, Cees Duin
TSMC
2008
138views more  TSMC 2008»
15 years 1 months ago
Image Thresholding Using Graph Cuts
A novel thresholding algorithm is presented in this paper to improve image segmentation performance at a low computational cost. The proposed algorithm uses a normalized graphcut m...
Wenbing Tao, Hai Jin, Yimin Zhang, Liman Liu, Desh...
TSMC
2008
229views more  TSMC 2008»
15 years 1 months ago
A Comprehensive Survey of Multiagent Reinforcement Learning
Multiagent systems are rapidly finding applications in a variety of domains, including robotics, distributed control, telecommunications, and economics. The complexity of many task...
Lucian Busoniu, Robert Babuska, Bart De Schutter