نتایج جستجو برای: mathematical planning

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

2013
Kais Lakhdar Lazaros Papageorgiou

Multiproduct manufacturing facilities running on a campaign basis are increasingly becoming the norm for biopharmaceuticals, owing to high risks of clinical failure, regulatory pressures and the increasing number of therapeutics in clinical evaluation. The need for such flexible plants and cost-effective manufacture pose significant challenges for planning and scheduling, which are compounded b...

Journal: :Ad Hoc Networks 2012
Silvia Boiardi Antonio Capone Brunilde Sansò

This paper deals with the joint planning and energy management operation of Wireless Mesh Networks. We claim that energy management should be incorporated at the planning stages to produce an effective energy-management operation. For this, we propose a mathematical framework that takes into account the trade-off of capital expenditures versus energy-related operational ones when designing the ...

2006
Maurizio Bruglieri Leo Liberti

We propose mathematical programming models for solving problems arising from planning and running an energy production process based on burning biomasses. The models take into account different aspects of the problem: determination of the biomasses to produce and/or buy, transportation decisions to convey the materials to the respective plants, and plant design. Whereas the “running model” is l...

2009
Gary M. Muir David G.L. Van Wylen

Planning for new science facilities at your institution is an exciting, challenging, and rewarding endeavor. Perhaps most significantly, it also embodies a rare opportunity to provide new infrastructure to support a programmatic vision for the future. Here, we describe St. Olaf's new Regents Hall of Natural and Mathematical Sciences, beginning with an outline of the planning/design process, the...

1991
Edwin P. D. Pednault

This paper presents a general, mathematically rigorous approach to nonlinear planning that handles both complex goals and actions with context-dependent effects. A goal can be any arbitrary well-formed formula containing conjunctions, disjunctions, negations, and quantifiers. Actions are likewise not constrained and can have an unrestricted number of complex, situation-dependent effects. The ap...

2006
Evangelos Kaisar

Title of Dissertation: A STOWAGE PLANNING MODEL FOR MULTIPORT CONTAINER TRANSPORTATION Evangelos I. Kaisar Doctor of Philoshophy, 2006 Dissertation directed by: Professor Ali Haghani Department of Civil and Environmental Engineering The ship turnaround time at container terminals is an important measure of a port’s efficiency and attractiveness. The speed and quality of load planning affect the...

Journal: :Logic Journal of the IGPL 2003
Mateja Jamnik Manfred Kerber Martin Pollet Christoph Benzmüller

In this paper we present an approach to automated learning within mathematical reasoning systems. In particular, the approach enables proof planning systems to automatically learn new proof methods from well-chosen examples of proofs which use a similar reasoning pattern to prove related theorems. Our approach consists of an abstract representation for methods and a machine learning technique w...

Journal: :CoRR 2015
Afsane Akbarzadeh Elham Shadkam

Constrained Nonlinear programming problems are hard problems, and one of the most widely used and common problems for production planning problem to optimize. In this study, one of the mathematical models of production planning is survey and the problem solved by cuckoo algorithm. Cuckoo Algorithm is efficient method to solve continues non linear problem. Moreover, mentioned models of productio...

2012
P. Raja S. Pugazhenthi

Motion planning of mobile robots is a complex problem. The complexity further increases when it comes to path planning in dynamic environments. This paper presents an algorithm for on-line path planning of mobile robots in unknown environments with moving obstacles. A mathematical model is established which considers all the current on-line information of robot as well as nearing obstacles. Par...

1992
Ian Frank David A. Basin Alan Bundy

We present Finesse, a system that forms optimal plans for declarer play in the game of Bridge. Finesse generalises the technique of proof-planning, developed at Edinburgh University in the context of mathematical theorem-proving, to deal with the dis-junctive choice encountered when planning under uncertainty , and the context-dependency of actions produced by the presence of an opposition. In ...

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

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