536 search results - page 3 / 108 » Planning by Abstraction Using HW[] |
DAC
1996
ACM
13 years 11 months ago
1996
ACM
Abstract -- This paper introduces a new HW/SW partitioning algorithm used in automating the instruction set processor design for pipelined ASIP (Application Specific Integrated Pro...
AIPS
2011
12 years 11 months ago
2011
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
WILF
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper is a first step in the direction of extending possibilistic planning to take advantage of the expressive power and reasoning capabilities of fuzzy description...
EWCBR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
AGENTS
1999
Springer
13 years 12 months ago
1999
Springer
Uncertain and complex environments demand that an agent be able to anticipate the actions of others in order to avoid resource conflicts with them and to realize its goals. Confli...