2693 search results - page 41 / 539 » On Computing Complex Navigation Functions |
FPCA
1989
14 years 1 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
ICDCSW
2002
IEEE
14 years 2 months ago
2002
IEEE
In Marc Weiser’s vision of ubiquitous computing, users are located in an environment with potentially thousands of computers around them. Many capabilities of these smart device...
AML
2008
13 years 10 months ago
2008
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
AML
1998
13 years 9 months ago
1998
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
PODC
2006
ACM
14 years 3 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...