4061 search results - page 137 / 813 » The Dynamics of Change |
156
click to vote
WEA
2009
Springer
16 years 1 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
159
click to vote
AAAI
2006
15 years 8 months ago
2006
Unmotivated students do not reap the full rewards of using a computer-based intelligent tutoring system. Detection of improper behavior is thus an important component of an online...
159
click to vote
WADS
1993
Springer
15 years 10 months ago
1993
Springer
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
177
click to vote
CLIMA
2004
15 years 8 months ago
2004
In a dynamic environment, even if an agent makes a plan to obtain a goal, the environment might change while the agent is executing the plan. In that case, the plan, which was init...
158
click to vote
WWW
2010
ACM
16 years 1 months ago
2010
ACM
Breakpoints are perhaps the quintessential feature of a debugger: they allow a developer to stop time and study the program state. Breakpoints are typically specified by selectin...