نتایج جستجو برای: controllable processing times

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

2015
Michael McCourt Jeffrey J. Green Ellen Lau Alexander Williams

Sentences such as "The ship was sunk to collect the insurance" exhibit an unusual form of anaphora, implicit control, where neither anaphor nor antecedent is audible. The non-finite reason clause has an understood subject, PRO, that is anaphoric; here it may be understood as naming the agent of the event of the host clause. Yet since the host is a short passive, this agent is realized by no aud...

2013
Leszek Wroński

There is a remarkable similarity between some mathematical objects used in the Branching Space-Times framework and those appearing in computer science in the fields of event structures for concurrent processing and Chu spaces. This paper introduces the similarities and formulates a few open questions for further research, hoping that both BST theorists and computer scientists can benefit from t...

2012
Xiupeng Wei Andrew Kusiak

Sludge is a byproduct of wastewater processing suitable for biogas production. The biogas consisting of about 60% methane can be used to generate electricity and heat. A data-driven approach for optimization of biogas production process in a wastewater treatment plant is presented. The process model is developed using routinely collected data categorized as controllable and uncontrollable varia...

Journal: :IEICE Transactions 2009
Jae-Hoon Jang Sung-Hak Lee Kyu-Ik Sohng

The Processing of high-dynamic-range (HDR) images is embodied by a lot of algorithms. This paper takes notice of one of these algorithms which is presented using the iCAM06. iCAM06 is capable of making color appearance predictions of HDR images based on CIECAM02 color predictions and incorporating spatial process models in the human visual system (HVS) for contrast enhancement. The effect of us...

Journal: :CoRR 2015
Davide Giglio

Four lemmas, which constitute the theoretical foundation necessary to determine optimal control strategies for a class of single machine family scheduling problems, are presented in this technical report. The scheduling problem is characterized by the presence of sequence-dependent batch setup and controllable processing times; moreover, the generalized due-date model is adopted in the problem....

2015
T. Brecht W. Pfaff C. Wang Y. Chu

As experimental quantum information processing (QIP) rapidly advances, an emerging challenge is to design a scalable architecture that combines various quantum elements into a complex device without compromising their performance. In particular, superconducting quantum circuits have successfully demonstrated many of the requirements for quantum computing, including coherence levels that approac...

2013
Lyzu Yasmin Xianjue Chen Keith A. Stubbs Colin L. Raston

A vortex fluidic device (VFD) involving a rapidly rotating tube open at one end forms dynamic thin films at high rotational speed for finite sub-millilitre volumes of liquid, with shear within the films depending on the speed and orientation of the tube. Continuous flow operation of the VFD where jet feeds of solutions are directed to the closed end of the tube provide additional tuneable shear...

2011
Frank Werner

Genetic algorithms are a very popular heuristic which have been successfully applied to many optimization problems within the last 30 years. In this chapter, we give a survey on some genetic algorithms for shop scheduling problems. In a shop scheduling problem, a set of jobs has to be processed on a set of machines such that a specific optimization criterion is satisfied. According to the restr...

2004
Bruno Damas Pedro Lima

This paper introduces a method to model multi-robot teams using stochastic discrete event system techniques. The environment state space and robot behaviours are discretised and modelled by modular finite state automata (FSA). Then, all the FSA are composed to obtain the complete model of the team situated in its environment. Controllable and uncontrollable events are identified. Exponential di...

2010
Ganggang Niu Shudong Sun Pascal Lafon Lionel Roucoules

JSP with discretely controllable processing times (JSP-DCPT) that are perturbed in a turbulent environment is formulated, based on which, a time-cost tradeoff based predictive-reactive scheduling approach is proposed for solving the problem. In the predictive scheduling process, on the basis of a proposed three-step decomposition approach for solving JSP-DCPT, a solution initialization algorith...

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

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