It is well known that Data Envelopment Analysis (DEA) is a relative efficiency measurement tool, which uses optimization techniques to automatically calculate the weights assigned to the crisp deterministic multiple inputs and outputs of a set of the Decision Making Units (DMUs) being assessed. However, crisp deterministic data requirement delimits an application to the real world problems wher...

The difficulty of developing reliable parallel software is generating interest in deterministic environments, where a given program and input can yield only one possible result. Languages or type systems can enforce determinism in new code, and runtime systems can impose synthetic schedules on legacy parallel code. To parallelize existing serial code, however, we would like a programming model ...

a linear programming model has been presented for finding an appropriate planning in order to maximize hotel revenue. in this model, a special planning horizon has been considered that includes several busy days of a year. there are several reservation periods that may start a few months earlier. each period of reservation may have different prices and so result different incomes. hotel custome...

There has been a lot of interest lately from people solving constrained optimization problems for Constraint Programming (CP). Constraint programming cannot be described as a technique by itself but perhaps better as a class of computer languages tailored to the expression and resolution of problems which are non-deterministic in nature, with a fast program development and eecient runtime perfo...

Constraint-logic object-oriented programming provides a useful symbiosis between and constraint-logic search. The ability to use logic variables, constraints, non-deterministic search, in an integrated way facilitates the combination of search-related program parts other business applications. With this work we add array-typed variables (“free arrays”), thus completing set types that can assume...

To solve the multi-stage linear programming problem, one may use a deterministic or a stochastic approach. The drawbacks of the two techniques are well known: the deterministic approach is unrealistic under uncertainty and the stochastic approach suffers from scenario explosion. We introduce a new scheme, whose objective is to overcome both drawbacks. The focus of this new scheme is on events i...

To solve the multi-stage linear programming problem, one may use a deterministic or a stochastic approach. The drawbacks of the two techniques are well known: the deterministic approach is unrealistic under uncertainty and the stochastic approach suffers from scenario explosion. We introduce a new technique, whose objective is to overcome both drawbacks. The focus of this new technique is on ev...

We introduce a programming language for embedded systems. The language is based on the process algebra pmc which like ccs has concurrent composition of processes and synchronous point-to-point communication. Determinism and distributability are desirable, but contradictory properties. The programming language therefore contains operators that allow for both local deterministic concurrency and g...

We consider in this paper so called simple bracketed languages having special limitations. They are sometimes used for the definitions of some grammatical structures of programming languages. Generally speaking, these languages are context-free, but not deterministic contextfree, i.e., they cannot be defined by deterministic push-down automata. For the simple bracketed languages having special ...

We study the gossiping problem in directed ad-hoc radio networks. Our main result is a deterministic algorithm that solves this problem in an n-node network in time O(n log n). The algorithm allows the labels (identifiers) of the nodes to be polynomially large in n, and is based on a novel way of using selective families. The previous best general (i.e., dependent only on n) deterministic upper...