3229 search results - page 512 / 646 » The Theory of Timed Automata |
180
click to vote
ESA
1998
Springer
15 years 10 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
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...
158
click to vote
CHI
1997
ACM
15 years 10 months ago
1997
ACM
Searching for an item in a long ordered list is a frequent task when using any kind of computing device (from desktop PCs to mobile phones). This paper explores three different int...
139
click to vote
VLDB
1997
ACM
15 years 10 months ago
1997
ACM
The enhanced pay-per-view (EPPV) model for providing continuous-media-on-demand(CMOD) services associates with each continuous media clip a display frequency that dependson the cl...
169
click to vote
POPL
1990
ACM
15 years 10 months ago
1990
ACM
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...