An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem
|
|
- Iris Harper
- 6 years ago
- Views:
Transcription
1 An Ant Colony Otimization Aroach to the Probabilistic Traveling Salesman Problem Leonora Bianchi 1, Luca Maria Gambardella 1, and Marco Dorigo 2 1 IDSIA, Strada Cantonale Galleria 2, CH-6928 Manno, Switzerland {leonora,luca}@idsia.ch htt:// 2 Université Libre de Bruxelles, IRIDIA Avenue Franklin Roosevelt 50, CP 194/6, 1050 Brusselles, Belgium mdorigo@ulb.ac.be htt://iridia.ulb.ac.be/ mdorigo/ Abstract. The Probabilistic Traveling Salesman Problem (PTSP) is a TSP roblem where each customer has a given robability of requiring a visit. The goal is to find an a riori tour of minimal exected length over all customers, with the strategy of visiting a random subset of customers in the same order as they aear in the a riori tour. We address the question of whether and in which context an a riori tour found by a TSP heuristic can also be a good solution for the PTSP. We answer this question by testing the relative erformance of two ant colony otimization algorithms, Ant Colony System (ACS) introduced by Dorigo and Gambardella for the TSP, and a variant of it (ACS) which aims to minimize the PTSP objective function. We show in which robability configuration of customers ACS and ACS are romising algorithms for the PTSP. 1 Introduction Consider a routing roblem through a set V of n customers. On any given instance of the roblem each customer i has a known osition and a robability i of actually requiring a visit, indeendently of the other customers. Finding a solution for this roblem imlies having a strategy to determine a tour for each random subset S V, in such a way as to minimize the exected tour length. The most studied strategy is the a riori one. An a riori strategy has two comonents: the a riori tour and the udating method. The a riori tour is a tour visiting the comlete set V of n customers; the udating method modifies the a riori tour in order to have a articular tour for each subset of customers S V. A very simle examle of udating method is the following: for every subset of customers, visit them in the same order as they aear in the a riori tour, skiing the customers that do not belong to the subset. The strategy related to this method is called the skiing strategy. The roblem of finding an a riori tour of minimum exected length under the skiing strategy is defined as the Probabilistic Traveling Salesman Problem (PTSP). This is an NP-hard roblem [1,2], and was introduced in Jaillet s PhD thesis [3]. J.J. Merelo Guervós et al. (Eds.): PPSN VII, LNCS 2439, , c Sringer-Verlag Berlin Heidelberg 2002
2 884 Leonora Bianchi, Luca Maria Gambardella, and Marco Dorigo The PTSP aroach models alications in a delivery context where a set of customers has to be visited on a regular (e.g., daily) basis, but all customers do not always require a visit, and where re-otimizing vehicle routes from scratch every day is unfeasible. In this context the delivery man would follow a standard route (i.e., an a riori tour), leaving out customers that on that day do not require a visit. The standard route of least exected length corresonds to the otimal PTSP solution. In the literature there are a number of algorithmic and heuristic aroaches used to find subotimal solutions for the PTSP. Heuristics using a nearest neighbor criterion or savings criterion were imlemented and tested by Jézéquel [4] and by Rossi-Gavioli [5]. Later, Bertsimas-Jaillet-Odoni [1] and Bertsimas-Howell [6] have further investigated some of the roerties of the PTSP and have roosed some heuristics for the PTSP. These include tour construction heuristics (sace filling curves and radial sort), and tour imrovement heuristics (robabilistic 2-ot edge interchange local search and robabilistic 1-shift local search). Most of the heuristics roosed are an adatation of a TSP heuristic to the PTSP, or even the TSP heuristic itself, which in some cases gives good PTSP solutions. More recently, Laorte-Louveaux-Mercure [7] have alied an integer L-shaed method to the PTSP and have solved to otimality instances involving u to 50 vertices. No alication of nature-insired algorithms such as ant colony otimization (ACO) [8] or genetic algorithms has been done yet. This aer investigates the otentialities of ACO algorithms for the PTSP. In the remainder of the aer we first introduce the PTSP objective function and notations (section 2), then we describe the ACO algorithms which we tested (section 3), and finally we show the exerimental results obtained (section 4). 2 The PTSP Objective Function Let us consider an instance of the PTSP. We have a comletely connected grah whose nodes form a set V = {i =1, 2,..., n} of customers. Each customer has a robability i of requiring a visit, indeendently from the others. A solution for this instance is a tour over all nodes in V (an a riori tour ), to which is associated the exected length objective function E[L ]= (S)L (S). (1) S V In the above exression, S is a subset of the set of nodes V, L (S) is the distance required to visit the subset of customers S (in the same order as they aear in the a riori tour), and (S) is the robability for the subset of customers S to require a visit: (S) = i (1 i ). (2) i S i V S Jaillet [3] showed that the evaluation of the PTSP objective function (eq.(1)) can be done in O(n 2 ). In fact, let us consider (without loss of generality) an a riori tour =(1, 2,...,n); then its exected length is
3 An Ant Colony Otimization Aroach 885 (0) (1) (2) Fig. 1. The lengths of these sets of (sub)tours, (0), (1) and (2), constitute the first three terms of the exected length for the homogeneous PTSP. From left to right, the total length of each set of (sub)tours gives the terms L (0) (4)., L(1) and L (2) of equation E[L ]= n n i=1 j=i+1 d ij i j j 1 k=i+1 (1 k )+ n i 1 d ij i j i=1 j=1 n k=i+1 j 1 (1 k ) (1 l ). (3) This exression is derived by looking at the robability for each arc of the comlete grah to be used, that is, when the a riori tour is adated by skiing a set of customers which do not require a visit. For instance, an arc (i, j) is actually used only when customers i and j do require a visit, while customers i +1,i+2,..., j do not require a visit. This event occurs with robability j 1 i j k=i+1 (1 k) (when j n). In the secial class of PTSP instances where i = for all customers i V (the homogeneous PTSP), equation (3) becomes n 2 E[L ]= 2 (1 ) r L (r) (4) r=0 where L (r) n j=1 d(j, (j +1+r) modn). The L(r) s have the combinatorial interretation of being the lengths of a collection of gcd(n,r + 1) sub-tours 1 (r) l=1, obtained from tour by visiting one customer and skiing the next r customers. As an examle, Fig. 1 shows (0) (i.e., the a riori tour), (1) and for a PTSP with 8 customers. (2) 3 Ant Colony Otimization In ACO algorithms a colony of artificial ants iteratively constructs solutions for the roblem under consideration using artificial heromone trails and heuristic information. The heromone trails are modified by ants during the algorithm execution in order to store information about good solutions. Most ACO algorithms follow the algorithmic scheme given in Fig The term gcd stays for greatest common divisor.
4 886 Leonora Bianchi, Luca Maria Gambardella, and Marco Dorigo rocedure ACO metaheuristic for combinatorial otimization roblems Set arameters, initialize heromone trails while (termination condition not met) ConstructSolutions (AlyLocalSearch) UdateTrails end while Fig. 2. High level seudocode for the ACO metaheuristic. ACO are solution construction algorithms, which, in contrast to local search algorithms, may not find a locally otimal solution. Many of the best erforming ACO algorithms imrove their solutions by alying a local search algorithm after the solution construction hase. Our rimary goal in this work is to analyze the PTSP tour construction caabilities of ACO, hence in this first investigation we do not use local search. We aly to the PTSP Ant Colony System (ACS) [9,10], a articular ACO algorithm which was successfully alied to the TSP. We also consider a modification of ACS which exlicitly takes into account the PTSP objective function (we call this algorithm robabilistic ACS, that is, ACS). In the following, we describe how ACS and ACS build a solution and how they udate heromone trails. 3.1 Solution Construction in ACS and ACS A feasible solution for an n-city PTSP is an a riori tour which visits all customers. Initially m ants are ositioned on their starting cities chosen according to some initialization rule (e.g., randomly). Then, the solution construction hase starts (rocedure ConstructSolutions in Fig. 2). Each ant rogressively builds a tour by choosing the next customer to move to on the basis of two tyes of information, the heromone τ and the heuristic information η. To each arc joining two customers i, j it is associated a varying quantity of heromone τ ij, and the heuristic value η ij =1/d ij, which is the inverse of the distance between i and j. When an ant k is on city i, the next city is chosen as follows. With robability q 0, a city j that maximizes τ ij η β ij is chosen in the set J k (i) of the cities not yet visited by ant k. Here, β is a arameter which determines the relative influence of the heuristic information. With robability 1 q 0, a city j is chosen randomly with a robability given by τ ij η β ij, if j J k (i, j) = k (i) r J k (i) τir ηβ ir (5) 0, otherwise. Hence, with robability q 0 the ant chooses the best city according to the heromone trail and to the distance between cities, while with robability 1 q 0 it exlores the search sace in a biased way.
5 An Ant Colony Otimization Aroach Pheromone Trails Udate in ACS and ACS Pheromone trails are udated in two stages. In the first stage, each ant, after it has chosen the next city to move to, alies the following local udate rule: τ ij (1 ρ) τ ij + ρ τ 0, (6) where ρ, 0<ρ 1, and τ 0, are two arameters. The effect of the local udating rule is to make less desirable an arc which has already been chosen by an ant, so that the exloration of different tours is favored during one iteration of the algorithm. The second stage of heromone udate occurs when all ants have terminated their tour. Pheromone is modified on those arcs belonging to the best tour since the beginning of the trial (best-so-far tour), by the following global udating rule τ ij (1 α) τ ij + α τ ij, (7) where τ ij = ObjectiveF unc 1 best (8) with 0 <α 1being the heromone decay arameter, and ObjectiveF unc best is the value of the objective function of the best-so-far tour. In ACS the objective function is the a riori tour length, while in ACS the objective function is the PTSP exected length of the a riori tour. In the next section we discuss in more detail the differences between ACS and ACS. 3.3 Discussion of Differences between ACS and ACS Differences between ACS and ACS are due to the fact that the two algorithms exloit different objective functions in the heromone udating hase. The global udating rule of equations (7) and (8) imlies two differences in the way ACS and ACS exlore the search sace. The first and most imortant difference is the set of arcs on which heromone is globally increased, which is in general different in ACS and ACS. In fact, the best tour in eq. (8) is relative to the objective function. Therefore in ACS the search will be biased toward the shortest tour, while in ACS it will be biased toward the tour of minimum exected length. The second difference between ACS and ACS is in the quantity τ ij by which heromone is increased on the selected arcs. This asect is less imortant than the first, because ACO in general is more sensitive to the difference of heromone among arcs than to its absolute value. The length of an a riori tour (ACS objective function) may be considered as an O(n) aroximation to the O(n 2 ) exected length (ACS objective function). In general, the worse the aroximation, the worse will be the solution quality of ACS versus ACS. The quality of the aroximation deends on the set of customer robabilities i. In the homogeneous PTSP, where customer robability is for all customers, it is easy to see the relation between the two objective functions. For a given a riori tour L we have
6 888 Leonora Bianchi, Luca Maria Gambardella, and Marco Dorigo n 2 = L E[L ]=(1 2 )L (1 ) r L (r), (9) which imlies O(q L ) (10) for (1 ) =q 0. Therefore the higher the robability, the better is the a riori tour length L as an aroximation for the exected tour length E[L ]. In the heterogeneous PTSP, it is not easy to see the relation between the two objective functions, since each arc of the a riori tour L is multilied by a different robabilistic weight (see eq.(3)), and a term with L cannot be isolated in the exression of E[L ], as in the homogeneous case. ACS and ACS also differ in time comlexity. In both algorithms one iteration (i.e., one cycle through the while condition of Fig. 2) is O(n 2 ) [11], but the constant of roortionality is bigger in ACS than in ACS. To see this one should consider the rocedure UdateTrail of Fig. 2, where the best-so-far tour must be evaluated in order to choose the arcs on which heromone is to be udated. The evaluation of the best-so-far tour requires O(n) time in ACS and O(n 2 ) time in ACS. ACS is thus faster and always erforms more iterations than ACS for a fixed CPU time. r=1 4 Exerimental Tests 4.1 Homogeneous PTSP Instances Homogeneous PTSP instances were generated starting from TSP instances and assigning to each customer a robability of requiring a visit. TSP instances were taken from two benchmarks. The first is the TSPLIB at htt:// From this benchmark we considered instances with a number of city between 50 and 200. The second benchmark is a grou of instances where customers are randomly distributed on the square [0, 10 6 ]. Both uniform and clustered distributions where considered in this case, and the number of cities varied between 50 and 350. For generating random instances we used the Instance Generator Code of the 8 th DIMACS Imlementation Challenge at htt://research.att.com/dsj/chts/download.html. 4.2 Comutational Environment and ACS Parameters Exeriments were run on a Pentium Xeon, 1GB of RAM, 1.7 GHz rocessor. In order to asses the relative erformance of ACS versus ACS indeendently from the details of the settings, the two algorithms were run with the same arameters. We chose the same settings which yielded good erformance in earlier studies with ACS on the TSP [10]: m = 10, β = 2, q 0 = 0.98, α = ρ = 0.1 and τ 0 =1/(n Obj ), where n is the number of customers and Obj is the value of the objective function evaluated with the nearest neighbor heuristic [10].
7 An Ant Colony Otimization Aroach (<E_acs> - <E_acs>) / <E_acs> Fig. 3. Relative erformance of ACS versus ACS for the homogeneous PTSP. The vertical axis reresents (E[L (ACS)] E[L (ACS)])/E[L (ACS)]. On the horizontal axis there is the customer robability. Each oint of the grah is an average over 21 symmetric homogeneous PTSP instances. Error bars reresent average deviation, defined as n i=1 xi <x> /n, with n = 21. Note that for = 1 ACS outerforms ACS, since for a fixed CPU stoing time ACS makes more iterations. The stoing criterion used in both algorithms is CPU time in seconds, chosen according to the relation stotime = k n 2, with k =0.01. This value of k lets ACS erform at least iterations on roblems with u to 100 customers, and at least iterations on roblems with more than 100 customers. For each instance of the PTSP, we ran 5 indeendent runs of the algorithms. 4.3 Results For each TSP instance tested, nine exeriments were done varying the value of the customer robability from 0.1 to 0.9 with a 0.1 interval. Fig. 3 summarizes results obtained on 21 symmetric PTSP instances, one third of the instances were taken from the TSPLIB, the others were random instances (half of them uniform and half clustered). The figure shows the relative erformance of ACS versus ACS, averaged over the tested instances. A tyical result for a single instance is reorted in Fig. 4. As it was reasonable to exect, for small enough robabilities ACS outerforms ACS. In all roblems we tested though, there is a range of robabilities [ 0, 1] for which ACS outerforms ACS. The critical robability 0 at which this haens deends on the roblem. The reason why ACS does not always erform better than ACS is clear if we consider two asects: the comlexity (seed) of ACS versus ACS, and
8 890 Leonora Bianchi, Luca Maria Gambardella, and Marco Dorigo 0.05 eil76.ts 0 (<E_acs> - <E_acs>) / <E_acs> Fig. 4. Relative erformance of ACS versus ACS for the eil76.ts instance of the TSPLIB. Error bars reresent the average deviation of the result over 5 indeendent runs of the algorithms. the goodness of the PTSP objective function aroximation as aroaches 1. When is near to 1, a good solution to the TSP is also a good solution to the PTSP; therefore, ACS, which erforms more iterations than ACS, has a better chance to find a good solution. 4.4 Absolute Performance For the PTSP instances we tested, the otimal solution is not known. Therefore, an absolute erformance evaluation of the ACS heuristic can only be done against a theoretical lower bound, when this is available and tight enough. A lower bound to the otimal solution would give us an uer bound to the error erformed by the ACS heuristic. In fact, if LB is the lower bound and E[L ] is the otimal solution, then by definition we have E[L ] LB. (11) If the solution value of ACS is E[L ], then the following inequality holds for the relative error E[L ] E[L ] E[L ] LB. (12) E[L ] LB For the homogeneous PTSP and for instances where the otimal length L TSP of the corresonding TSP is known, it is ossible to use the following lower bound to the otimal exected length [6] LB = L TSP (1 (1 ) n 1 ). (13)
9 An Ant Colony Otimization Aroach eil51.ts eil76.ts kroa100.ts ch150.ts d198.ts uer bound of relative % error Fig. 5. Uer bound of relative ercent error of ACS for 5 TSPLIB instances. The horizontal axis reresents the customer robability. If we ut this lower bound into the right side of equation (12), we obtain an uer bound of the relative error of ACS. Fig. 5 shows the absolute erformance of ACS, evaluated with this method, for a few TSPLIB instances. From the figure we see that, for instance, ACS finds a solution within 15% of the otimum for a homogeneous PTSP with customers robability Conclusions and Future Work In this aer we investigated the otentialities of ACO algorithms for the PTSP. In articular, we have shown that the ACS algorithm is a romising heuristic for homogeneous TSP instances. Moreover, for customers robabilities close to 1, the ACS heuristic is a better alternative than ACS. At resent we are investigating the heterogeneous PTSP, for different robability configurations of customers. This is an interesting direction of research, since it is closer to a real-world roblem than the homogeneous PTSP. We are also trying to imrove ACS erformance by inserting in the ants tour construction criterion information about the customers robabilities. Work which will follow this aer also comrehends a comarison of ACS with resect to other PTSP algorithms. Moreover, ACS should be imroved by adding to the tour construction hase a local search algorithm. The best choice and design of such a local search is also an interesting issue for the PTSP. Acknowledgments This research has been artially suorted by the Swiss National Science Foundation roject titled On-line fleet management, grant 16R10FM, and by the
10 892 Leonora Bianchi, Luca Maria Gambardella, and Marco Dorigo Metaheuristics Network, a Research Training Network funded by the Imroving Human Potential rogramme of the CEC, grant HPRN-CT The information rovided in this aer is the sole resonsibility of the authors and does not reflect the Community s oinion. The Community is not resonsible for any use that might be made of data aearing in this ublication. Marco Dorigo acknowledges suort from the Belgian FNRS, of which he is a Senior Research Associate. References 1. D. J. Bertsimas, P. Jaillet, and A. Odoni. A riori otimization. Oerations Research, 38: , D. J. Bertsimas. Probabilistic Combinatorial Otimization Problems. PhD thesis, MIT, Cambridge, MA, P. Jaillet. Probabilistic Traveling Salesman Problems. PhD thesis, MIT, Cambridge, MA, A. Jézéquel. Probabilistic Vehicle Routing Problems. Master s thesis, MIT, Cambridge, MA, F. A. Rossi and I. Gavioli. Asects of Heuristic Methods in the Probabilistic Traveling Salesman Problem, ages World Scientific, Singaore, D. J. Bertsimas and L. Howell. Further results on the robabilistic traveling salesman roblem. Euroean Journal of Oerational Research, 65:68 95, G. Laorte, F. Louveaux, and H. Mercure. An exact solution for the a riori otimization of the robabilistic traveling salesman roblem. Oerations Research, 42: , M. Dorigo, G. Di Caro, and L. M. Gambardella. Ant algorithms for discrete otimization. Artificial Life, 5(2): , L. M. Gambardella and M. Dorigo. Solving symmetric and asymmetric TSPs by ant colonies. In Proceedings of the 1996 IEEE International Conference on Evolutionary Comutation (ICEC 96), ages IEEE Press, Piscataway, NJ, M. Dorigo and L. M. Gambardella. Ant Colony System: A cooerative learning aroach to the traveling salesman roblem. IEEE Transactions on Evolutionary Comutation, 1(1):53 66, M. Dorigo, V. Maniezzo, and A. Colorni. The Ant System: Otimization by a colony of cooerating agents. IEEE Transactions on Systems, Man, and Cybernetics Part B, 26(1):29 41, 1996.
Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic
Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic Leonora Bianchi 1, Luca Maria Gambardella 1 and Marco Dorigo 2 1 IDSIA, Strada Cantonale Galleria 2, CH-6928 Manno,
More informationApproximating min-max k-clustering
Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost
More informationShadow Computing: An Energy-Aware Fault Tolerant Computing Model
Shadow Comuting: An Energy-Aware Fault Tolerant Comuting Model Bryan Mills, Taieb Znati, Rami Melhem Deartment of Comuter Science University of Pittsburgh (bmills, znati, melhem)@cs.itt.edu Index Terms
More informationDIFFERENTIAL evolution (DE) [3] has become a popular
Self-adative Differential Evolution with Neighborhood Search Zhenyu Yang, Ke Tang and Xin Yao Abstract In this aer we investigate several self-adative mechanisms to imrove our revious work on [], which
More informationDETC2003/DAC AN EFFICIENT ALGORITHM FOR CONSTRUCTING OPTIMAL DESIGN OF COMPUTER EXPERIMENTS
Proceedings of DETC 03 ASME 003 Design Engineering Technical Conferences and Comuters and Information in Engineering Conference Chicago, Illinois USA, Setember -6, 003 DETC003/DAC-48760 AN EFFICIENT ALGORITHM
More informationInformation collection on a graph
Information collection on a grah Ilya O. Ryzhov Warren Powell February 10, 2010 Abstract We derive a knowledge gradient olicy for an otimal learning roblem on a grah, in which we use sequential measurements
More informationInformation collection on a graph
Information collection on a grah Ilya O. Ryzhov Warren Powell October 25, 2009 Abstract We derive a knowledge gradient olicy for an otimal learning roblem on a grah, in which we use sequential measurements
More informationOn Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm
On Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm Gabriel Noriega, José Restreo, Víctor Guzmán, Maribel Giménez and José Aller Universidad Simón Bolívar Valle de Sartenejas,
More informationA SIMPLE PLASTICITY MODEL FOR PREDICTING TRANSVERSE COMPOSITE RESPONSE AND FAILURE
THE 19 TH INTERNATIONAL CONFERENCE ON COMPOSITE MATERIALS A SIMPLE PLASTICITY MODEL FOR PREDICTING TRANSVERSE COMPOSITE RESPONSE AND FAILURE K.W. Gan*, M.R. Wisnom, S.R. Hallett, G. Allegri Advanced Comosites
More informationProbability Estimates for Multi-class Classification by Pairwise Coupling
Probability Estimates for Multi-class Classification by Pairwise Couling Ting-Fan Wu Chih-Jen Lin Deartment of Comuter Science National Taiwan University Taiei 06, Taiwan Ruby C. Weng Deartment of Statistics
More information1 1 c (a) 1 (b) 1 Figure 1: (a) First ath followed by salesman in the stris method. (b) Alternative ath. 4. D = distance travelled closing the loo. Th
18.415/6.854 Advanced Algorithms ovember 7, 1996 Euclidean TSP (art I) Lecturer: Michel X. Goemans MIT These notes are based on scribe notes by Marios Paaefthymiou and Mike Klugerman. 1 Euclidean TSP Consider
More informationMauro Birattari, Prasanna Balaprakash, and Marco Dorigo
Chapter 10 THE ACO/F-RACE ALGORITHM FOR COMBINATORIAL OPTIMIZATION UNDER UNCERTAINTY Mauro Birattari, Prasanna Balaprakash, and Marco Dorigo IRIDIA, CoDE, Université Libre de Bruxelles, Brussels, Belgium
More informationLinear diophantine equations for discrete tomography
Journal of X-Ray Science and Technology 10 001 59 66 59 IOS Press Linear diohantine euations for discrete tomograhy Yangbo Ye a,gewang b and Jiehua Zhu a a Deartment of Mathematics, The University of Iowa,
More informationMODELING THE RELIABILITY OF C4ISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL
Technical Sciences and Alied Mathematics MODELING THE RELIABILITY OF CISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL Cezar VASILESCU Regional Deartment of Defense Resources Management
More informationAn Analysis of Reliable Classifiers through ROC Isometrics
An Analysis of Reliable Classifiers through ROC Isometrics Stijn Vanderlooy s.vanderlooy@cs.unimaas.nl Ida G. Srinkhuizen-Kuyer kuyer@cs.unimaas.nl Evgueni N. Smirnov smirnov@cs.unimaas.nl MICC-IKAT, Universiteit
More informationConvex Optimization methods for Computing Channel Capacity
Convex Otimization methods for Comuting Channel Caacity Abhishek Sinha Laboratory for Information and Decision Systems (LIDS), MIT sinhaa@mit.edu May 15, 2014 We consider a classical comutational roblem
More informationAnt Algorithms. Ant Algorithms. Ant Algorithms. Ant Algorithms. G5BAIM Artificial Intelligence Methods. Finally. Ant Algorithms.
G5BAIM Genetic Algorithms G5BAIM Artificial Intelligence Methods Dr. Rong Qu Finally.. So that s why we ve been getting pictures of ants all this time!!!! Guy Theraulaz Ants are practically blind but they
More informationParallel Quantum-inspired Genetic Algorithm for Combinatorial Optimization Problem
Parallel Quantum-insired Genetic Algorithm for Combinatorial Otimization Problem Kuk-Hyun Han Kui-Hong Park Chi-Ho Lee Jong-Hwan Kim Det. of Electrical Engineering and Comuter Science, Korea Advanced Institute
More informationUncorrelated Multilinear Principal Component Analysis for Unsupervised Multilinear Subspace Learning
TNN-2009-P-1186.R2 1 Uncorrelated Multilinear Princial Comonent Analysis for Unsuervised Multilinear Subsace Learning Haiing Lu, K. N. Plataniotis and A. N. Venetsanooulos The Edward S. Rogers Sr. Deartment
More informationA generalization of Amdahl's law and relative conditions of parallelism
A generalization of Amdahl's law and relative conditions of arallelism Author: Gianluca Argentini, New Technologies and Models, Riello Grou, Legnago (VR), Italy. E-mail: gianluca.argentini@riellogrou.com
More informationImplementation of a Column Generation Heuristic for Vehicle Scheduling in a Medium-Sized Bus Company
7e Conférence Internationale de MOdélisation et SIMulation - MOSIM 08 - du 31 mars au 2 avril 2008 Paris- France «Modélisation, Otimisation MOSIM 08 et Simulation du 31 mars des Systèmes au 2 avril : 2008
More informationEstimation of the large covariance matrix with two-step monotone missing data
Estimation of the large covariance matrix with two-ste monotone missing data Masashi Hyodo, Nobumichi Shutoh 2, Takashi Seo, and Tatjana Pavlenko 3 Deartment of Mathematical Information Science, Tokyo
More informationUpdating ACO Pheromones Using Stochastic Gradient Ascent and Cross-Entropy Methods
Updating ACO Pheromones Using Stochastic Gradient Ascent and Cross-Entropy Methods Marco Dorigo 1, Mark Zlochin 2,, Nicolas Meuleau 3, and Mauro Birattari 4 1 IRIDIA, Université Libre de Bruxelles, Brussels,
More informationOptimal Design of Truss Structures Using a Neutrosophic Number Optimization Model under an Indeterminate Environment
Neutrosohic Sets and Systems Vol 14 016 93 University of New Mexico Otimal Design of Truss Structures Using a Neutrosohic Number Otimization Model under an Indeterminate Environment Wenzhong Jiang & Jun
More informationEvaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models
Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models Ketan N. Patel, Igor L. Markov and John P. Hayes University of Michigan, Ann Arbor 48109-2122 {knatel,imarkov,jhayes}@eecs.umich.edu
More information4. Score normalization technical details We now discuss the technical details of the score normalization method.
SMT SCORING SYSTEM This document describes the scoring system for the Stanford Math Tournament We begin by giving an overview of the changes to scoring and a non-technical descrition of the scoring rules
More informationarxiv: v1 [cond-mat.stat-mech] 1 Dec 2017
Suscetibility Proagation by Using Diagonal Consistency Muneki Yasuda Graduate School of Science Engineering, Yamagata University Kazuyuki Tanaka Graduate School of Information Sciences, Tohoku University
More informationDiverse Routing in Networks with Probabilistic Failures
Diverse Routing in Networks with Probabilistic Failures Hyang-Won Lee, Member, IEEE, Eytan Modiano, Senior Member, IEEE, Kayi Lee, Member, IEEE Abstract We develo diverse routing schemes for dealing with
More informationOn split sample and randomized confidence intervals for binomial proportions
On slit samle and randomized confidence intervals for binomial roortions Måns Thulin Deartment of Mathematics, Usala University arxiv:1402.6536v1 [stat.me] 26 Feb 2014 Abstract Slit samle methods have
More informationCOMPARISON OF VARIOUS OPTIMIZATION TECHNIQUES FOR DESIGN FIR DIGITAL FILTERS
NCCI 1 -National Conference on Comutational Instrumentation CSIO Chandigarh, INDIA, 19- March 1 COMPARISON OF VARIOUS OPIMIZAION ECHNIQUES FOR DESIGN FIR DIGIAL FILERS Amanjeet Panghal 1, Nitin Mittal,Devender
More informationCapacitor Placement for Economical Electrical Systems using Ant Colony Search Algorithm
Capacitor Placement for Economical Electrical Systems using Ant Colony Search Algorithm Bharat Solanki Abstract The optimal capacitor placement problem involves determination of the location, number, type
More informationTowards understanding the Lorenz curve using the Uniform distribution. Chris J. Stephens. Newcastle City Council, Newcastle upon Tyne, UK
Towards understanding the Lorenz curve using the Uniform distribution Chris J. Stehens Newcastle City Council, Newcastle uon Tyne, UK (For the Gini-Lorenz Conference, University of Siena, Italy, May 2005)
More informationAnt Colony Optimization: an introduction. Daniel Chivilikhin
Ant Colony Optimization: an introduction Daniel Chivilikhin 03.04.2013 Outline 1. Biological inspiration of ACO 2. Solving NP-hard combinatorial problems 3. The ACO metaheuristic 4. ACO for the Traveling
More informationFor q 0; 1; : : : ; `? 1, we have m 0; 1; : : : ; q? 1. The set fh j(x) : j 0; 1; ; : : : ; `? 1g forms a basis for the tness functions dened on the i
Comuting with Haar Functions Sami Khuri Deartment of Mathematics and Comuter Science San Jose State University One Washington Square San Jose, CA 9519-0103, USA khuri@juiter.sjsu.edu Fax: (40)94-500 Keywords:
More information3D HP Protein Folding Problem using Ant Algorithm
3D HP Protein Folding Problem using Ant Algorithm Fidanova S. Institute of Parallel Processing BAS 25A Acad. G. Bonchev Str., 1113 Sofia, Bulgaria Phone: +359 2 979 66 42 E-mail: stefka@parallel.bas.bg
More informationOn the Chvatál-Complexity of Knapsack Problems
R u t c o r Research R e o r t On the Chvatál-Comlexity of Knasack Problems Gergely Kovács a Béla Vizvári b RRR 5-08, October 008 RUTCOR Rutgers Center for Oerations Research Rutgers University 640 Bartholomew
More informationOnline homotopy algorithm for a generalization of the LASSO
This article has been acceted for ublication in a future issue of this journal, but has not been fully edited. Content may change rior to final ublication. Online homotoy algorithm for a generalization
More information2-D Analysis for Iterative Learning Controller for Discrete-Time Systems With Variable Initial Conditions Yong FANG 1, and Tommy W. S.
-D Analysis for Iterative Learning Controller for Discrete-ime Systems With Variable Initial Conditions Yong FANG, and ommy W. S. Chow Abstract In this aer, an iterative learning controller alying to linear
More informationSystem Reliability Estimation and Confidence Regions from Subsystem and Full System Tests
009 American Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA June 0-, 009 FrB4. System Reliability Estimation and Confidence Regions from Subsystem and Full System Tests James C. Sall Abstract
More informationPretest (Optional) Use as an additional pacing tool to guide instruction. August 21
Trimester 1 Pretest (Otional) Use as an additional acing tool to guide instruction. August 21 Beyond the Basic Facts In Trimester 1, Grade 7 focus on multilication. Daily Unit 1: The Number System Part
More informationA Comparison between Biased and Unbiased Estimators in Ordinary Least Squares Regression
Journal of Modern Alied Statistical Methods Volume Issue Article 7 --03 A Comarison between Biased and Unbiased Estimators in Ordinary Least Squares Regression Ghadban Khalaf King Khalid University, Saudi
More informationarxiv: v1 [physics.data-an] 26 Oct 2012
Constraints on Yield Parameters in Extended Maximum Likelihood Fits Till Moritz Karbach a, Maximilian Schlu b a TU Dortmund, Germany, moritz.karbach@cern.ch b TU Dortmund, Germany, maximilian.schlu@cern.ch
More informationA New Method of DDB Logical Structure Synthesis Using Distributed Tabu Search
A New Method of DDB Logical Structure Synthesis Using Distributed Tabu Search Eduard Babkin and Margarita Karunina 2, National Research University Higher School of Economics Det of nformation Systems and
More informationPreconditioning techniques for Newton s method for the incompressible Navier Stokes equations
Preconditioning techniques for Newton s method for the incomressible Navier Stokes equations H. C. ELMAN 1, D. LOGHIN 2 and A. J. WATHEN 3 1 Deartment of Comuter Science, University of Maryland, College
More informationEnd-to-End Delay Minimization in Thermally Constrained Distributed Systems
End-to-End Delay Minimization in Thermally Constrained Distributed Systems Pratyush Kumar, Lothar Thiele Comuter Engineering and Networks Laboratory (TIK) ETH Zürich, Switzerland {ratyush.kumar, lothar.thiele}@tik.ee.ethz.ch
More informationTopology Optimization of Three Dimensional Structures under Self-weight and Inertial Forces
6 th World Congresses of Structural and Multidiscilinary Otimization Rio de Janeiro, 30 May - 03 June 2005, Brazil Toology Otimization of Three Dimensional Structures under Self-weight and Inertial Forces
More informationRecursive Estimation of the Preisach Density function for a Smart Actuator
Recursive Estimation of the Preisach Density function for a Smart Actuator Ram V. Iyer Deartment of Mathematics and Statistics, Texas Tech University, Lubbock, TX 7949-142. ABSTRACT The Preisach oerator
More informationBayesian System for Differential Cryptanalysis of DES
Available online at www.sciencedirect.com ScienceDirect IERI Procedia 7 (014 ) 15 0 013 International Conference on Alied Comuting, Comuter Science, and Comuter Engineering Bayesian System for Differential
More informationON POLYNOMIAL SELECTION FOR THE GENERAL NUMBER FIELD SIEVE
MATHEMATICS OF COMPUTATIO Volume 75, umber 256, October 26, Pages 237 247 S 25-5718(6)187-9 Article electronically ublished on June 28, 26 O POLYOMIAL SELECTIO FOR THE GEERAL UMBER FIELD SIEVE THORSTE
More informationFeedback-error control
Chater 4 Feedback-error control 4.1 Introduction This chater exlains the feedback-error (FBE) control scheme originally described by Kawato [, 87, 8]. FBE is a widely used neural network based controller
More informationPlotting the Wilson distribution
, Survey of English Usage, University College London Setember 018 1 1. Introduction We have discussed the Wilson score interval at length elsewhere (Wallis 013a, b). Given an observed Binomial roortion
More informationLower Confidence Bound for Process-Yield Index S pk with Autocorrelated Process Data
Quality Technology & Quantitative Management Vol. 1, No.,. 51-65, 15 QTQM IAQM 15 Lower onfidence Bound for Process-Yield Index with Autocorrelated Process Data Fu-Kwun Wang * and Yeneneh Tamirat Deartment
More informationEfficient algorithms for the smallest enclosing ball problem
Efficient algorithms for the smallest enclosing ball roblem Guanglu Zhou, Kim-Chuan Toh, Jie Sun November 27, 2002; Revised August 4, 2003 Abstract. Consider the roblem of comuting the smallest enclosing
More informationOne step ahead prediction using Fuzzy Boolean Neural Networks 1
One ste ahead rediction using Fuzzy Boolean eural etworks 1 José A. B. Tomé IESC-ID, IST Rua Alves Redol, 9 1000 Lisboa jose.tome@inesc-id.t João Paulo Carvalho IESC-ID, IST Rua Alves Redol, 9 1000 Lisboa
More informationEstimation of component redundancy in optimal age maintenance
EURO MAINTENANCE 2012, Belgrade 14-16 May 2012 Proceedings of the 21 st International Congress on Maintenance and Asset Management Estimation of comonent redundancy in otimal age maintenance Jorge ioa
More informationGeneralized Coiflets: A New Family of Orthonormal Wavelets
Generalized Coiflets A New Family of Orthonormal Wavelets Dong Wei, Alan C Bovik, and Brian L Evans Laboratory for Image and Video Engineering Deartment of Electrical and Comuter Engineering The University
More informationCorrespondence Between Fractal-Wavelet. Transforms and Iterated Function Systems. With Grey Level Maps. F. Mendivil and E.R.
1 Corresondence Between Fractal-Wavelet Transforms and Iterated Function Systems With Grey Level Mas F. Mendivil and E.R. Vrscay Deartment of Alied Mathematics Faculty of Mathematics University of Waterloo
More informationThe non-stochastic multi-armed bandit problem
Submitted for journal ublication. The non-stochastic multi-armed bandit roblem Peter Auer Institute for Theoretical Comuter Science Graz University of Technology A-8010 Graz (Austria) auer@igi.tu-graz.ac.at
More informationMATHEMATICAL MODELLING OF THE WIRELESS COMMUNICATION NETWORK
Comuter Modelling and ew Technologies, 5, Vol.9, o., 3-39 Transort and Telecommunication Institute, Lomonosov, LV-9, Riga, Latvia MATHEMATICAL MODELLIG OF THE WIRELESS COMMUICATIO ETWORK M. KOPEETSK Deartment
More informationAlgorithms for Air Traffic Flow Management under Stochastic Environments
Algorithms for Air Traffic Flow Management under Stochastic Environments Arnab Nilim and Laurent El Ghaoui Abstract A major ortion of the delay in the Air Traffic Management Systems (ATMS) in US arises
More informationImprovement on the Decay of Crossing Numbers
Grahs and Combinatorics 2013) 29:365 371 DOI 10.1007/s00373-012-1137-3 ORIGINAL PAPER Imrovement on the Decay of Crossing Numbers Jakub Černý Jan Kynčl Géza Tóth Received: 24 Aril 2007 / Revised: 1 November
More informationVIBRATION ANALYSIS OF BEAMS WITH MULTIPLE CONSTRAINED LAYER DAMPING PATCHES
Journal of Sound and Vibration (998) 22(5), 78 85 VIBRATION ANALYSIS OF BEAMS WITH MULTIPLE CONSTRAINED LAYER DAMPING PATCHES Acoustics and Dynamics Laboratory, Deartment of Mechanical Engineering, The
More informationLogistics Optimization Using Hybrid Metaheuristic Approach under Very Realistic Conditions
17 th Euroean Symosium on Comuter Aided Process Engineering ESCAPE17 V. Plesu and P.S. Agachi (Editors) 2007 Elsevier B.V. All rights reserved. 1 Logistics Otimization Using Hybrid Metaheuristic Aroach
More informationSIMULATED ANNEALING AND JOINT MANUFACTURING BATCH-SIZING. Ruhul SARKER. Xin YAO
Yugoslav Journal of Oerations Research 13 (003), Number, 45-59 SIMULATED ANNEALING AND JOINT MANUFACTURING BATCH-SIZING Ruhul SARKER School of Comuter Science, The University of New South Wales, ADFA,
More informationGOOD MODELS FOR CUBIC SURFACES. 1. Introduction
GOOD MODELS FOR CUBIC SURFACES ANDREAS-STEPHAN ELSENHANS Abstract. This article describes an algorithm for finding a model of a hyersurface with small coefficients. It is shown that the aroach works in
More informationJohn Weatherwax. Analysis of Parallel Depth First Search Algorithms
Sulementary Discussions and Solutions to Selected Problems in: Introduction to Parallel Comuting by Viin Kumar, Ananth Grama, Anshul Guta, & George Karyis John Weatherwax Chater 8 Analysis of Parallel
More informationDialectical Theory for Multi-Agent Assumption-based Planning
Dialectical Theory for Multi-Agent Assumtion-based Planning Damien Pellier, Humbert Fiorino Laboratoire Leibniz, 46 avenue Félix Viallet F-38000 Grenboble, France {Damien.Pellier,Humbert.Fiorino}.imag.fr
More informationImplementation of Travelling Salesman Problem Using ant Colony Optimization
RESEARCH ARTICLE OPEN ACCESS Implementation of Travelling Salesman Problem Using ant Colony Optimization Gaurav Singh, Rashi Mehta, Sonigoswami, Sapna Katiyar* ABES Institute of Technology, NH-24, Vay
More informationA Model for Randomly Correlated Deposition
A Model for Randomly Correlated Deosition B. Karadjov and A. Proykova Faculty of Physics, University of Sofia, 5 J. Bourchier Blvd. Sofia-116, Bulgaria ana@hys.uni-sofia.bg Abstract: A simle, discrete,
More informationUniversal Finite Memory Coding of Binary Sequences
Deartment of Electrical Engineering Systems Universal Finite Memory Coding of Binary Sequences Thesis submitted towards the degree of Master of Science in Electrical and Electronic Engineering in Tel-Aviv
More informationUncorrelated Multilinear Discriminant Analysis with Regularization and Aggregation for Tensor Object Recognition
TNN-2007-P-0332.R1 1 Uncorrelated Multilinear Discriminant Analysis with Regularization and Aggregation for Tensor Object Recognition Haiing Lu, K.N. Plataniotis and A.N. Venetsanooulos The Edward S. Rogers
More informationState Estimation with ARMarkov Models
Deartment of Mechanical and Aerosace Engineering Technical Reort No. 3046, October 1998. Princeton University, Princeton, NJ. State Estimation with ARMarkov Models Ryoung K. Lim 1 Columbia University,
More informationRecent Developments in Multilayer Perceptron Neural Networks
Recent Develoments in Multilayer Percetron eural etworks Walter H. Delashmit Lockheed Martin Missiles and Fire Control Dallas, Texas 75265 walter.delashmit@lmco.com walter.delashmit@verizon.net Michael
More informationA Bound on the Error of Cross Validation Using the Approximation and Estimation Rates, with Consequences for the Training-Test Split
A Bound on the Error of Cross Validation Using the Aroximation and Estimation Rates, with Consequences for the Training-Test Slit Michael Kearns AT&T Bell Laboratories Murray Hill, NJ 7974 mkearns@research.att.com
More informationSignaled Queueing. Laura Brink, Robert Shorten, Jia Yuan Yu ABSTRACT. Categories and Subject Descriptors. General Terms. Keywords
Signaled Queueing Laura Brink, Robert Shorten, Jia Yuan Yu ABSTRACT Burstiness in queues where customers arrive indeendently leads to rush eriods when wait times are long. We roose a simle signaling scheme
More informationRANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES
RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES AARON ZWIEBACH Abstract. In this aer we will analyze research that has been recently done in the field of discrete
More informationStatics and dynamics: some elementary concepts
1 Statics and dynamics: some elementary concets Dynamics is the study of the movement through time of variables such as heartbeat, temerature, secies oulation, voltage, roduction, emloyment, rices and
More informationSelf-Adaptive Ant Colony System for the Traveling Salesman Problem
Proceedings of the 29 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 29 Self-Adaptive Ant Colony System for the Traveling Salesman Problem Wei-jie Yu, Xiao-min
More informationDistributed K-means over Compressed Binary Data
1 Distributed K-means over Comressed Binary Data Elsa DUPRAZ Telecom Bretagne; UMR CNRS 6285 Lab-STICC, Brest, France arxiv:1701.03403v1 [cs.it] 12 Jan 2017 Abstract We consider a networ of binary-valued
More informationScaling Multiple Point Statistics for Non-Stationary Geostatistical Modeling
Scaling Multile Point Statistics or Non-Stationary Geostatistical Modeling Julián M. Ortiz, Steven Lyster and Clayton V. Deutsch Centre or Comutational Geostatistics Deartment o Civil & Environmental Engineering
More informationChapter 7 Sampling and Sampling Distributions. Introduction. Selecting a Sample. Introduction. Sampling from a Finite Population
Chater 7 and s Selecting a Samle Point Estimation Introduction to s of Proerties of Point Estimators Other Methods Introduction An element is the entity on which data are collected. A oulation is a collection
More informationFig. 4. Example of Predicted Workers. Fig. 3. A Framework for Tackling the MQA Problem.
217 IEEE 33rd International Conference on Data Engineering Prediction-Based Task Assignment in Satial Crowdsourcing Peng Cheng #, Xiang Lian, Lei Chen #, Cyrus Shahabi # Hong Kong University of Science
More informationA Parallel Algorithm for Minimization of Finite Automata
A Parallel Algorithm for Minimization of Finite Automata B. Ravikumar X. Xiong Deartment of Comuter Science University of Rhode Island Kingston, RI 02881 E-mail: fravi,xiongg@cs.uri.edu Abstract In this
More informationEstimation of Separable Representations in Psychophysical Experiments
Estimation of Searable Reresentations in Psychohysical Exeriments Michele Bernasconi (mbernasconi@eco.uninsubria.it) Christine Choirat (cchoirat@eco.uninsubria.it) Raffaello Seri (rseri@eco.uninsubria.it)
More informationarxiv:cond-mat/ v2 25 Sep 2002
Energy fluctuations at the multicritical oint in two-dimensional sin glasses arxiv:cond-mat/0207694 v2 25 Se 2002 1. Introduction Hidetoshi Nishimori, Cyril Falvo and Yukiyasu Ozeki Deartment of Physics,
More informationThe Probabilistic Pickup and Delivery Problem
The Probabilistic Pickup and Delivery Problem Enrique Benavent 1, M. Landete 2, J.J. Salazar 3, G. Tirado 4 1 Departament d'estadística i Investigació Operativa, Universitat de València, Spain 2 Universidad
More informationSolved Problems. (a) (b) (c) Figure P4.1 Simple Classification Problems First we draw a line between each set of dark and light data points.
Solved Problems Solved Problems P Solve the three simle classification roblems shown in Figure P by drawing a decision boundary Find weight and bias values that result in single-neuron ercetrons with the
More informationThe Binomial Approach for Probability of Detection
Vol. No. (Mar 5) - The e-journal of Nondestructive Testing - ISSN 45-494 www.ndt.net/?id=7498 The Binomial Aroach for of Detection Carlos Correia Gruo Endalloy C.A. - Caracas - Venezuela www.endalloy.net
More informationPER-PATCH METRIC LEARNING FOR ROBUST IMAGE MATCHING. Sezer Karaoglu, Ivo Everts, Jan C. van Gemert, and Theo Gevers
PER-PATCH METRIC LEARNING FOR ROBUST IMAGE MATCHING Sezer Karaoglu, Ivo Everts, Jan C. van Gemert, and Theo Gevers Intelligent Systems Lab, Amsterdam, University of Amsterdam, 1098 XH Amsterdam, The Netherlands
More informationAI*IA 2003 Fusion of Multiple Pattern Classifiers PART III
AI*IA 23 Fusion of Multile Pattern Classifiers PART III AI*IA 23 Tutorial on Fusion of Multile Pattern Classifiers by F. Roli 49 Methods for fusing multile classifiers Methods for fusing multile classifiers
More information16.2. Infinite Series. Introduction. Prerequisites. Learning Outcomes
Infinite Series 6.2 Introduction We extend the concet of a finite series, met in Section 6., to the situation in which the number of terms increase without bound. We define what is meant by an infinite
More informationFinding Shortest Hamiltonian Path is in P. Abstract
Finding Shortest Hamiltonian Path is in P Dhananay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune, India bstract The roblem of finding shortest Hamiltonian ath in a eighted comlete grah belongs
More informationNew Schedulability Test Conditions for Non-preemptive Scheduling on Multiprocessor Platforms
New Schedulability Test Conditions for Non-reemtive Scheduling on Multirocessor Platforms Technical Reort May 2008 Nan Guan 1, Wang Yi 2, Zonghua Gu 3 and Ge Yu 1 1 Northeastern University, Shenyang, China
More informationOn a Markov Game with Incomplete Information
On a Markov Game with Incomlete Information Johannes Hörner, Dinah Rosenberg y, Eilon Solan z and Nicolas Vieille x{ January 24, 26 Abstract We consider an examle of a Markov game with lack of information
More informationPretest (Optional) Use as an additional pacing tool to guide instruction. August 21
Trimester 1 Pretest (Otional) Use as an additional acing tool to guide instruction. August 21 Beyond the Basic Facts In Trimester 1, Grade 8 focus on multilication. Daily Unit 1: Rational vs. Irrational
More informationPaper C Exact Volume Balance Versus Exact Mass Balance in Compositional Reservoir Simulation
Paer C Exact Volume Balance Versus Exact Mass Balance in Comositional Reservoir Simulation Submitted to Comutational Geosciences, December 2005. Exact Volume Balance Versus Exact Mass Balance in Comositional
More informationGIVEN an input sequence x 0,..., x n 1 and the
1 Running Max/Min Filters using 1 + o(1) Comarisons er Samle Hao Yuan, Member, IEEE, and Mikhail J. Atallah, Fellow, IEEE Abstract A running max (or min) filter asks for the maximum or (minimum) elements
More informationUsing a Computational Intelligence Hybrid Approach to Recognize the Faults of Variance Shifts for a Manufacturing Process
Journal of Industrial and Intelligent Information Vol. 4, No. 2, March 26 Using a Comutational Intelligence Hybrid Aroach to Recognize the Faults of Variance hifts for a Manufacturing Process Yuehjen E.
More informationApproximate Dynamic Programming for Dynamic Capacity Allocation with Multiple Priority Levels
Aroximate Dynamic Programming for Dynamic Caacity Allocation with Multile Priority Levels Alexander Erdelyi School of Oerations Research and Information Engineering, Cornell University, Ithaca, NY 14853,
More informationSession 5: Review of Classical Astrodynamics
Session 5: Review of Classical Astrodynamics In revious lectures we described in detail the rocess to find the otimal secific imulse for a articular situation. Among the mission requirements that serve
More information