209 search results - page 12 / 42 » The Computational Complexity of Weak Saddles |
CSL
1999
Springer
13 years 11 months ago
1999
Springer
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
PET
2004
Springer
14 years 25 days ago
2004
Springer
Internet computing technologies, like grid computing, enable a weak computational device connected to such a grid to be less limited by its inadequate local computational, storage,...
JFP
2000
13 years 7 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
AUIC
2000
IEEE
13 years 12 months ago
2000
IEEE
Electronic Blocks are a new programming interface, designed for children aged between three and eight years. The Electronic Blocks programming environment includes sensor blocks, ...
RTA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...