75 search results - page 8 / 15 » Computing Applicability Conditions for Plans with Loops |
ICCAD
2003
IEEE
14 years 4 months ago
2003
IEEE
— Memory-intensive applications present unique challenges to an ASIC designer in terms of the choice of memory organization, memory size requirements, bandwidth and access latenc...
ICPADS
2005
IEEE
14 years 1 months ago
2005
IEEE
Accurate measurement and modeling of IP networks is essential for network design, planning, and management. Efforts are being made to detect the state of the network from end-to-e...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
AIPS
2009
13 years 8 months ago
2009
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
CDC
2009
IEEE
13 years 5 months ago
2009
IEEE
based on extended set-membership filter (ESMF) and the path planning method in relative velocity coordinates (RVCs), a new 3D multiple Unmanned Aerial Vehicle (UAV) systems active ...