Sciweavers

3221 search results - page 175 / 645
» Termination of Linear Programs
Sort
View
WSC
2008
15 years 8 months ago
A study on port design automation concept
In this paper, an automation concept is proposed to facilitate the simulation model building for port design problem. Currently, this process, which includes drawing the terminal ...
Loo Hay Lee, Ek Peng Chew, Hai Xing Cheng, Yongbin...
NIPS
2000
15 years 7 months ago
APRICODD: Approximate Policy Construction Using Decision Diagrams
We propose a method of approximate dynamic programming for Markov decision processes (MDPs) using algebraic decision diagrams (ADDs). We produce near-optimal value functions and p...
Robert St-Aubin, Jesse Hoey, Craig Boutilier
FUIN
2006
81views more  FUIN 2006»
15 years 6 months ago
Redundant Call Elimination via Tupling
Redundant call elimination has been an important program optimisation process as it can produce super-linear speedup in optimised programs. In this paper, we investigate use of the...
Wei-Ngan Chin, Siau-Cheng Khoo, Neil Jones
SP
2008
IEEE
134views Security Privacy» more  SP 2008»
15 years 6 months ago
Expressive Declassification Policies and Modular Static Enforcement
This paper provides a way to specify expressive declassification policies, in particular, when, what, and where policies that include conditions under which downgrading is allowed...
Anindya Banerjee, David A. Naumann, Stan Rosenberg
LOGCOM
2007
126views more  LOGCOM 2007»
15 years 6 months ago
A Structural Proof of the Soundness of Rely/guarantee Rules
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...
Joey W. Coleman, Cliff B. Jones