1485 search results - page 186 / 297 » Whole Program Paths |
NETWORKS
2006
13 years 9 months ago
2006
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
AAECC
2005
Springer
13 years 9 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
AROBOTS
2002
13 years 9 months ago
2002
Tractors are the workhorses of the modern farm. By automating these machines, we can increase the productivity, improve safety, and reduce costs for many agricultural operations. ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
—In poorly constrained extra-vascular environments such as hollow viscera, current catheter navigation techniques are restricted to simple paths and therefore limit a doctor’s ...