نتایج جستجو برای: deterministic programming

تعداد نتایج: 370359  

Hubs are facilities to collect arrange and distribute commodities in telecommunication networks, cargo delivery systems, etc. In this paper, an uncapacitated phub center problem in case of single allocation and also multiple allocation will be introduced in which travel times or transportation costs are considered as fuzzy parameters. Then, by proposing new methods, the presented problem is con...

Supplier selection is one of the influential decisions for effectiveness of purchasing and manufacturing policies under competitive conditions of the market. Regarding the fact that decision makers (DMs) consider conflicting criteria for selecting suppliers, multiple-criteria programming is a promising approach to solve the problem. This paper develops a nadir compromise programming (NCP) model...

2007
Heinz Fa bender Sebastian Maneth

Although every implementation of a (functional) logic programming language is deterministic, the languages' semantics are almost always formalized as a \nondeterministic" binary relation. Hence, there still exists a gap between the semantics of a (functional) logic programming language and its implementation which has to be closed in particular if the correctness of the implementation is to be ...

2009
Chin-Yi Chen Jih-Jeng Huang Gwo-Hshiung Tzeng C.-Y. Chen J.-J. Huang

In economics, several parametric regression-based models have been proposed to measure the technical efficiency of decision making units (DMUs). However, the problem of misspecification restricts the use of these methods. In this paper, symbolic regression is employed to obtain the approximate optimal production function automatically using genetic programming (GP). Monte Carlo simulation is us...

2005
Christian Lasarczyk Wolfgang Banzhaf

Genetic Programming has been slow at realizing other programming paradigms than conventional, deterministic, sequential vonNeumann type algorithms. In this contribution we discuss a new method of execution of programs introduced recently: Algorithmic Chemistries. Therein, register machine instructions are executed in a non–deterministic order, following a probability distribution. Program behav...

1997
Michael Hanus

Functional and logic programming are often taught in different courses so that students often do not understand the relationships between these declarative programming paradigms. This is mainly due to the different underlying computation models—deterministic reduction and lazy evaluation in functional languages, and non-deterministic search in logic languages. We show in this paper that this ne...

2008
Robert L. Bocchino Vikram S. Adve Sarita V. Adve Marc Snir

In today’s widely used parallel programming models, subtle programming errors can lead to unintended nondeterministic behavior and hard to catch bugs. In contrast, we argue for a parallel programming model that is deterministic by default: deterministic behavior is guaranteed unless the programmer explicitly uses nondeterministic constructs. This goal is particularly challenging for modern obje...

2017
G. C. Sasmal S. K. Barik

Some of the real life decisions are made in decentralized manner under uncertainty. Stochastic bi-level linear programming problems are used to handle such decision making problems. In this paper, we have proposed stochastic bi-level linear programming problems where some of the right hand side parameters of the constraints in both first (leader) and second level (follower) as normal and log-no...

1997
Michael Hanus Ramin Sadre

Curry is a multi-paradigm declarative language aiming to amalgamate functional, logic, and concurrent programming paradigms. Curry combines in a seamless way features from functional programming and (concurrent) logic programming. Curry's operational semantics is based on the combination of lazy reduction of expressions together with a possibly non-deterministic binding of free variables occurr...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید