Sciweavers

4047 search results - page 316 / 810
» The Discrete Basis Problem
Sort
View
WSC
1998
15 years 6 months ago
Using ACCESSIBILITY to Assess the Performance of Generalized Hill Climbing Algorithms
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...
Sheldon H. Jacobson, Enver Yücesan
WSC
1997
15 years 6 months ago
Evaluation of a (R, s, Q, c) Multi-Item Inventory Replenishment Policy Through Simulation
In this paper, the case of a cardboard box marketing firm is studied and a (R,s,Q,c) inventory replenishment policy is proposed and evaluated by means of discrete event simulation...
Carlos B. Ramirez Cerda, Armando J. Espinosa de lo...
EPEW
2010
Springer
15 years 5 months ago
Accurate Performance Estimation for Stochastic Marked Graphs by Bottleneck Regrowing
Abstract. The adequate system performance is usually a critical requirement to be checked during the verification phase of a system. Thus, accurately measuring the performance of c...
Ricardo J. Rodríguez, Jorge Júlvez
123
Voted
ENTCS
2007
120views more  ENTCS 2007»
15 years 4 months ago
Non-Interference Control Synthesis for Security Timed Automata
In this paper, the problem of synthesizing controllers that ensures non interference for multilevel security dense timed discrete event systems modeled by an extension of Timed Au...
Guillaume Gardey, John Mullins, Olivier H. Roux
141
Voted
PC
2002
82views Management» more  PC 2002»
15 years 4 months ago
Time-minimal tiling when rise is larger than zero
This paper presents a solution to the open problem of finding the optimal tile size to minimise the execution time of a parallelogram-shaped iteration space on a distributed memory...
Jingling Xue, Wentong Cai