4103 search results - page 449 / 821 » Some results on the Collatz problem |
182
click to vote
ICRA
1993
IEEE
15 years 11 months ago
1993
IEEE
The problem of programming a robot t o carry out a systematic exploration of its environment using realistic sensors is considered in this paper. The robot is modelled as a single...
159
click to vote
INFOCOM
1993
IEEE
15 years 11 months ago
1993
IEEE
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bounds in ATM networks with rate-controlled, non-work conserving servers. A theore...
163
click to vote
CONCUR
1993
Springer
15 years 11 months ago
1993
Springer
cal Technique for Process Abstraction Glenn Bruns Department of Computer Science University of Edinburgh Edinburgh EH9 3JZ, UK Abstract. With algebraic laws a process can be simpli...
180
click to vote
LFCS
1994
Springer
15 years 10 months ago
1994
Springer
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
162
click to vote
SIGSOFT
1994
ACM
15 years 10 months ago
1994
ACM
Testing is potentially the best grounded part of software engineering, since it deals with the well defined situation of a fixed program and a test (a finite collection of input v...