Sciweavers

69 search results - page 1 / 14
» Fully Deadline-Coupled Planning: One Step at a Time
Sort
View
ISMIS
1991
Springer
13 years 11 months ago
Fully Deadline-Coupled Planning: One Step at a Time
Madhura Nirkhe, Sarit Kraus, Donald Perlis
ICQNM
2008
IEEE
178views Chemistry» more  ICQNM 2008»
14 years 1 months ago
A Quantum Network Manager that Supports a One-Time Pad Stream
We have begun to expand the NIST quantum key distribution (QKD) system into a quantum network to support secure cryptography. We are starting with a simple three-node network, one...
Alan Mink, Lijun Ma, Tassos Nakassis, Hai Xu, Oliv...
PROCEDIA
2010
116views more  PROCEDIA 2010»
13 years 5 months ago
Towards fully autonomic peer-to-peer systems
Large-scale distributed applications are becoming more and more demanding in terms of efficiency and flexibility of the technological infrastructure, for which traditional soluti...
Michele Amoretti
AUSAI
2007
Springer
13 years 11 months ago
Planning as Satisfiability with Relaxed $-Step Plans
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
Martin Wehrle, Jussi Rintanen
TJS
2002
94views more  TJS 2002»
13 years 7 months ago
A Fully Implicit Parallel Ocean Model Using MUMPS
The formulation, implementation and performance of a new fully implicit parallel model of the ocean circulation is presented. Within this model, steady states can be traced in one ...
Jos de Kloe, Aad J. van der Steen, Hakan Öks&...