Sciweavers

2968 search results - page 115 / 594
» Network Programming Using PLAN
Sort
View
120
Voted
AMC
2005
127views more  AMC 2005»
15 years 2 months ago
The identification of nondominated and efficient paths on a network
In this paper, we present an application of 0-1 linear programming problem in the indentification of the nondominated paths on a network. To find efficient paths, an adaptationof t...
Gholam Reza Jahanshahloo, F. Hosseinzadeh Lotfi, N...
CORR
2010
Springer
119views Education» more  CORR 2010»
15 years 2 months ago
Dynamic Policy Programming
In this paper, we consider the problem of planning and learning in the infinite-horizon discounted-reward Markov decision problems. We propose a novel iterative direct policysearc...
Mohammad Gheshlaghi Azar, Hilbert J. Kappen
PROMAS
2007
Springer
15 years 8 months ago
Modules as Policy-Based Intentions: Modular Agent Programming in GOAL
Modular programming has the usual benefits associated with structured programming, information hiding and reusability, but also has additional benefits to offer when applied in ...
Koen V. Hindriks
NETWORK
2008
68views more  NETWORK 2008»
15 years 2 months ago
A retrospective view of network address translation
Today, network address translators, or NATs, are everywhere. Their ubiquitous adoption was not promoted by design or planning but by the continued growth of the Internet, which pl...
Lixia Zhang
ATAL
2009
Springer
15 years 9 months ago
Agent programming with temporally extended goals
In planning as well as in other areas, temporal logic has been used to specify so-called temporally extended goals. Temporally extended goals refer to desirable sequences of state...
Koen V. Hindriks, Wiebe van der Hoek, M. Birna van...