Sciweavers

194 search results - page 14 / 39
» Approximate dynamic programming: Lessons from the field
Sort
View
ESORICS
2007
Springer
14 years 1 months ago
Obligations and Their Interaction with Programs
Obligations are pervasive in modern systems, often linked to access control decisions. We present a very general model of obligations as objects with state, and discuss its interac...
Daniel J. Dougherty, Kathi Fisler, Shriram Krishna...
POPL
1995
ACM
13 years 11 months ago
Parametric Program Slicing
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...
John Field, G. Ramalingam, Frank Tip
JSA
2008
124views more  JSA 2008»
13 years 7 months ago
Processor array architectures for flexible approximate string matching
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
Panagiotis D. Michailidis, Konstantinos G. Margari...
CCE
2004
13 years 7 months ago
Optimization under uncertainty: state-of-the-art and opportunities
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncer...
Nikolaos V. Sahinidis
AGILEDC
2003
IEEE
14 years 1 months ago
Agile Development in the old economy
As part of the delivery an automated hub for a postal operator, the Solystic company has to build a complex and feature rich Information System that supports a highly automated pr...
Géry Derbier