7106 search results - page 246 / 1422 » Restricted Complexity, General Complexity |
157
click to vote
AIEDU
2005
15 years 4 months ago
2005
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...
147
click to vote
AI
1999
Springer
15 years 4 months ago
1999
Springer
Forthcoming in the Journal of Aritificial Intelligence We introduce mathematical programming and atomic decomposition as the basic modal (T-Box) inference techniques for a large c...
135
click to vote
LATIN
2010
Springer
15 years 2 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
138
click to vote
SAGT
2010
Springer
15 years 2 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
129
click to vote
BMVC
2010
15 years 2 months ago
2010
Variational level set methods are formulated as energy minimisation problems, which are often solved by gradient-based optimisation methods, such as gradient descent. Unfortunatel...