Sciweavers

316 search results - page 57 / 64
» Where do security policies come from
Sort
View
FOCS
2003
IEEE
14 years 23 days ago
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim...
IJCAI
1997
13 years 8 months ago
Reasoning about Concurrent Execution Prioritized Interrupts, and Exogenous Actions in the Situation Calculus
As an alternative to planning, an approach to highlevel agent control based on concurrent program execution is considered. A formal definition in the situation calculus of such a ...
Giuseppe De Giacomo, Yves Lespérance, Hecto...
EJIS
2010
52views more  EJIS 2010»
13 years 7 months ago
Same technology, different outcome? Reinterpreting Barley's Technology as an Occasion for Structuring
In the last few decades, several studies have found the same technology implemented in highly similar organizational settings to be associated with very different consequences for...
Starling David Hunter III
HPCA
1998
IEEE
13 years 11 months ago
PRISM: An Integrated Architecture for Scalable Shared Memory
This paper describes PRISM, a distributed sharedmemory architecture that relies on a tightly integrated hardware and operating system design for scalable and reliable performance....
Kattamuri Ekanadham, Beng-Hong Lim, Pratap Pattnai...
NIPS
1993
13 years 8 months ago
Using Local Trajectory Optimizers to Speed Up Global Optimization in Dynamic Programming
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
Christopher G. Atkeson