Sciweavers

2968 search results - page 64 / 594
» Network Programming Using PLAN
Sort
View
COR
2008
88views more  COR 2008»
13 years 9 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
QRE
2011
13 years 14 days ago
Phase II monitoring of covariance stationary autocorrelated processes
papers/abstracts/authors within each session. • The Author and Session indices provide cross-reference assistance (pages 33-36). • The floor plan on page 6 shows you where tech...
Marcus B. Perry, Gary R. Mercado, Joseph J. Pignat...
UMUAI
1998
157views more  UMUAI 1998»
13 years 9 months ago
Bayesian Models for Keyhole Plan Recognition in an Adventure Game
We present an approach to keyhole plan recognition which uses a dynamic belief (Bayesian) network to represent features of the domain that are needed to identify users’ plans and...
David W. Albrecht, Ingrid Zukerman, Ann E. Nichols...
ICANN
2010
Springer
13 years 10 months ago
Neuro-symbolic Representation of Logic Programs Defining Infinite Sets
It has been one of the great challenges of neuro-symbolic integration to represent recursive logic programs using neural networks of finite size. In this paper, we propose to imple...
Ekaterina Komendantskaya, Krysia Broda, Artur S. d...
UM
2009
Springer
14 years 4 months ago
Recognition of Users' Activities Using Constraint Satisfaction
Ideally designed software allow users to explore and pursue interleaving plans, making it challenging to automatically recognize user interactions. The recognition algorithms prese...
Swapna Reddy, Ya'akov Gal, Stuart M. Shieber