318 search results - page 41 / 64 » Real Number Computability and Domain Theory |
MOBIHOC
2007
ACM
14 years 8 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
ECCV
1996
Springer
14 years 10 months ago
1996
Springer
An approach is presented for imposing generic hard constraints on deformable models at a low computational cost, while preserving the good convergence properties of snake-like mod...
MOBIHOC
2006
ACM
14 years 8 months ago
2006
ACM
Location knowledge of nodes in a network is essential for many tasks such as routing, cooperative sensing, or service delivery in ad hoc, mobile, or sensor networks. This paper in...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
ATAL
2006
Springer
14 years 18 days ago
2006
Springer
As agent systems are solving more and more complex tasks in increasingly challenging domains, the systems themselves are becoming more complex too, often compromising their adapti...