498 search results - page 55 / 100 » A Theory of Complexity for Continuous Time Systems |
168
click to vote
JELIA
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
140
Voted
ATAL
2007
Springer
16 years 10 days ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
149
Voted
GRID
2007
Springer
15 years 6 months ago
2007
Springer
It is often difficult to perform efficiently a collection of jobs with complex job dependencies due to temporal unpredictability of the grid. One way to mitigate the unpredictabili...
152
Voted
CCGRID
2009
IEEE
16 years 28 days ago
2009
IEEE
— As the scale and complexity of parallel systems continue to grow, failures become more and more an inevitable fact for solving large-scale applications. In this research, we pr...
167
click to vote
AIED
2009
Springer
16 years 23 days ago
2009
Springer
Identifying effective tutorial strategies is a key problem for tutorial dialogue systems research. Ongoing work in human-human tutorial dialogue continues to reveal the complex phe...