INTEGRATIVE COOPERATIVE APPROACH FOR SOLVING PERMUTATION FLOWSHOP SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT FAMILY SETUP TIMES
|
|
- Justin Norman
- 6 years ago
- Views:
Transcription
1 8 th International Conference of Modeling and Siulation - MOSIM 10 - May 10-12, Haaet - Tunisia Evaluation and optiization of innovative production systes of goods and services INTEGRATIVE COOPERATIVE APPROACH FOR SOLVING PERMUTATION FLOWSHOP SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT FAMILY SETUP TIMES R. Bouabda, M. Eddaly FSEGS Route de l aéroport Sfax -Tunisie radhouan.bouabda@gail.co, eddaly.ansour@gail.co B. Jarboui, A. Rebai FSEGS Route de l aéroport Sfax -Tunisie basse_jarboui@yahoo.fr, abdelwaheb.rebai@fsegs.rnu.tn ABSTRACT: This paper addresses to the perutation flowline anufacturing cell with sequence dependent faily setup ties proble. The objective is to iniize the aespan criterion. We propose a cooperative approach including a genetic algorith and a branch and bound procedure. The latter is probabilistically integrated in the genetic algorith in order to enhance the current solution. Moreover, the application of the branch and bound algorith is based upon the decoposition of the proble into subprobles. The perforance of the proposed approach is tested by nuerical experients on a large nuber of representative test probles. KEYWORDS: Branch and bound; Genetic algorith; Flowline anufacturing cell; Setup ties; Maespan 1 INTRODUCTION Since the early 1960 s, the developent of Cellular Manufacturing (CM), as one of Group Technology (GT) subsets, has received uch attention of practitioners and researchers in the anufacturing systes. The ajor issues are the reduction of the coplexity and the increase of the productivity of job shops (Greene and Sadowsi, 1984). Operationally, the CM consists in arranging a set of siilar jobs into part failies. These siilarities concern the jobs setups, achinery requireents and operations. In (Greene and Sadowsi, 1984) any industrial applications have been presented in CM environents such that chip producing, etal fabricating, and anual assebly industries. Hendizadeh et al. (2008) have presented a detailed literature review of scheduling in cellular anufacturing systes. In this paper we consider the scheduling of CM environent while processing the jobs with the sae setup faily together. In each faily, there is a set of n jobs that ust be processed on a set of achines in the sae order without pre-eption (no interruption is allowed). Such cells are nown as flowline cells or pure flowshop anufacturing cells (Schaller et al., 2000). This proble occurs when the tie required to shift fro one part (job) to another is negligible or included in the processing ties. However, the tie required to shift fro one faily to another is high and cannot be neglected. A coprehensive review can be found in (Cheng et al.,2000) for the flowshop scheduling probles with setup ties. They have included the proble under consideration in sequence dependent faily setup ties (SDFST) category. Schaller et al. (2000) have presented a real world application in the anufacturing printing circuit boards where the use of CM technology is highly required. Garey and Johnson (1979) have showed that this proble is strongly NP-hard with respect to the aespan criterion. Schaller et al. (2000) have developed lower bounds for solving this proble. The obtained results have showed that the branch and bound is efficient for the sall test probles. However, when the nuber of failies or the nuber of achines increases, the perforance of the proposed lower bounds decreases. Also, several constructive heuristics have been proposed in (Schaller et al., 2000). The coputational results have showed that, for scheduling the jobs within failies, the called "CDS" heuristic (Capbell et al., 1970) is the best one. Besides, the NEH heuristic (Nawaz et al., 1983) is the ost efficient regarding the job failies scheduling. França et al. (2005) have presented two evolutionary algoriths: a Genetic Algorith (GA) and a Meetic Algorith (MA). The coputational results showed that these two algoriths outperfor existing best heuristic. In addition MA presents a slight superiority according to the GA. Hendizadeh et al. (2008) have proposed a Tabu Search algorith (TS). They have eployed the Siulated Annealing algorith (SA) concepts for balancing between intensification and diversification of the search s direction. Their results have showed that the proposed algorith, in average, outperfors the constructive heuristic of Schaller et al., (2000) in ters of solution quality but not in ters of CPU ties. Moreover, the TS algorith and the MA of França et al. (2005) appear siilar in average. Lin et al. (2009) have proposed three different etaheureustics including SA, GA and TS for solving this proble. It s noted that the proposed SA and GA outperfor MA of and França et al. (2005) and TS of Hendizadeh et al.
2 MOSIM 10 - May 10-12, Haaet - Tunisia (2008) both regarding the solution quality and the CPU ties. In this paper, our purpose is to develop an efficient integrative cooperative approach based on a Genetic Algorith and a Branch and Bound procedure. The latter is eployed as an iproveent procedure for the evolutionary algorith. Our idea is to prove that, for this proble, the introduction of the exact algorith into the evolutionary are ore efficient than the cooperation with local search ethods. 2 PROBLEM FORMULATION The focus of this research is to schedule a perutation flowline anufacturing cell with sequence dependent faily setup ties where it is desired to iniize the aespan. The ajor assuptions of this study are: All jobs are available for processing at the start tie. Nuber of parts, their processing ties, the nuber of part failies, and their setup ties are nown in advance and are non-negative integers. Every part can be processed by at ost one achine at any given tie without preeption. Each achine can handle only one part at a tie and is persistently available to process all scheduled parts when required. Both the sequence of part failies and parts within each faily are the sae on all achines. All jobs in the current faily ust be finished before switching failies. The faily setup ties are sequence dependant. A changeover between jobs within a part faily requires inor setup tie and can be included in the processing ties of each job. Switching between part failies requires a ajor setup and hence requires an explicit treatent of setup ties. For a foral definition of the proble consider the following notation. M Nuber of achines. K Nuber of failies. Index for achines ( = 1, 2,..., M ). f Index for failies ( f = 1,2,..., K). N f Nuber of jobs in faily f. J Index for jobs ( j = 1,2,..., N f ). J f Set of jobs in faily f. s Setup tie for faily f processed iediately after rf 0 1 [ ] faily r at achine. S Setup tie for the first faily processed on achine. P Processing tie of job j in faily f on achine. fj π π π π π is = { [ ], 1 [ 2],..., [ ]} is a set of sequence where K the job sequence within the faily sequenced in position f of π. δ The job sequenced in position j of the job sequence f [ j] for faily f. C( δ, ) The copletion tie on achine of the [ j] job sequenced in position j of the job sequence for the faily sequenced in position f ofπ. C( δ [ ][ ],0) = 0 for j = 1,2,..., N f j and f = 1,2,..., K. C(0, ) = 0 for = 1,2,..., M. { δ } [ ][ ] C( δ, ) = ax C(, 1), S + P for [ ][ ] [ ][ ] [ ] = 1,2,..., M. C( δ[ ][ ], ) = ax C( δ 1 [ ][ 1 ], 1), C( δ[ 1 ], ) + S f f f N [ ] + P [ 1] 1 f f 1 f for f = 2,3,..., K. C( δ, ) = ax C( δ, 1), C( δ, ) + P [ j] [ j] [ j 1] f j for j = 2,3,..., N and f = 1,2,..., K. The objective of the proble is to find the π that results δ K N [ K ] in the iniu C( [ ], M ) 3 THE PROPOSED APPROACH Recently, a new wave of optiization tools has been arisen which attepts to cooperate between several algoriths of resolution. Two ways of cooperation or hybridization have been proposed on the literature based on the ind of the algoriths. We find the cooperation between approxiation algoriths, in such way two etaheuristics are coupled with each others and cooperation between etaheuristics and exact algoriths. Blu (2010) and Lozano and Martinez (2010) have addressed to the type of hybridization between different etaheuristics in a Special issue in Coputers and Operations Research (Blu, 2010). In the other hand, Jourdan et al., (2009) have presented the different approaches of cobining exact algoriths and etaheuristics to solve cobinatorial optiization probles. We propose a cooperative approach that cobines the Branch-and-Bound and genetic algorith ethods to solve the anufacturing cell scheduling proble considered here. First, the proble is tacled with a genetic algorith then a Branch-and-Bound (B&B) enhanceent procedure is proposed to iprove the genetic algorith perforance. 3.1 The Genetic algorith In what follows, we present the fraewor of our proposed algorith Solutions encoding and population initialization The used encoding schee can be represented erely by 1+ K vectors where K denotes the nuber of failies. The first vector corresponds to the perutation order of part failies processed on achines and the last K vectors represents the perutation order of parts
3 MOSIM 10 - May 10-12, Haaet - Tunisia within each part faily. We choose to generate each chroosoe in the initial population of size P randoly in our experients Selection In our algorith, the selected individuals (parents) are chosen randoly fro the initial population Crossover In our case we use two-point crossover operator which can be described as follows: the parents are divided at a rando into two points that is nevertheless identical for both parents. The content outside the selected two points is constantly transferred fro the first parent to the children whereas the contents inside is taen fro the second parent in the sae order as they are showed fro left to right. For the faily sequence, this operator is used at each iteration of our genetic algorith where the nuber of faily is greater than 3, i.e. the probability crossover of the faily sequences is equal to 1. However, within each faily, the sequences of jobs are also recobined following this fraewor: a rando nuber in the range [0.1] is drawn. If this nuber is greater than or equal to a job given probability pcross and the nuber of jobs exceeds 3 then we apply the crossover operator described above. If the rando nuber is greater than p and the nuber job cross of jobs in the sequence is less than 3 then the sequence of the jobs of the children tae the sae sequence of the first parent. Otherwise, a rando sequence of jobs is generated Mutation The second operator used by genetic algorith is the utation operator. The ai of utation is to escape fro the trap of local optiu by introducing faint odification in the sequence. In this way, utation helps genetic algorith to explore the whole search space and thus preserving population diversity. In our case, we use swap utation which consists of choosing two rando points in the sequence of faily and perforing all possible swap oves in the section between these two points. Also, the siilar operator is used for each sequence of jobs within faily. 3.2 The B&B procedure The solution π of our proble obtained by genetic algorith tae the following structure { [ ], [ ],..., [ ], [ ], [ 1],..., f f f + [ K] } π = π π π π π π where {,,..., } π = δ δ δ is the sequence of job [ 1] [ 2] N within the faily sequenced in the position f of π. For each solution generated by the genetic algorith, we define a probability α which indicates if the enhanceent procedure will be applied. This probability depends on the quality of the solution where the individuals with good quality will be favored. So, in our paper, this probability is deterined as follows: incubent best < α best where "incubent" designates the current solution provided by the genetic algorith and "best" denotes the best solution obtained so far. This restriction is considered as profitable in ters of coputational tie of the algorith when only a part of individuals will be subjected to the application of the branch and bound algorith. In the literature of hybrid evolutionary algoriths, this ind of probability is used by Jarboui et al. (2008) as a threshold acceptance and in Ruiz et al. (2006) is called enhanceent probability. In order to iprove the solution obtained by the genetic algorith we re-optiize the partial schedule within each faily f, π, by the branch and bound algorith. Therefore, the latter is based upon decoposition of the whole proble into subprobles i.e. by considering one proble into each faily. In such way, in each faily, we consider the proble as perutation flowshop scheduling proble with achine availability constraint. In our study, the branch and bound algorith can be considered as an intensification operator. We start by sequencing the jobs within the faily sequenced in the first position then to the jobs within the faily sequenced in the second position and so on. The branch and bound algorith is used only for the sequence of jobs of only one faily and the reaining K-1 sequences of jobs are already fixed by the genetic algorith. It should be noted that the probability α leads to guarantee a good partial schedule when the fixed part of the solution is provided following to a certain deviation according to the best solution. It is possible to perfor branch and bound algorith several ties to optiise the schedule of jobs within the sae faily, until no iproveent can be attained. The proposed branch and bound algorith is used for finding optial job sequences within a faily sequenced in position f of π, f = 1,2,..., K. The procedure was terinated when the nuber of nodes generated exceeded η. ( ) ax By considering the search tree for our algorith, the root node φ corresponds to the null schedule of jobs within the faily sequenced in position f. Each of the other nodes corresponds to a partial schedule δ where {,,..., } δ = δ δ δ is a subset of jobs to be [ 1] [ 2] [ e] placed at the beginning of the sequence of jobs within the faily sequenced in the position f. The job δ [ j] occupies the 1 f th j position in the schedule of faily sequenced in position f, e N[ ], N is the nuber of jobs in J. Let δ = J[ ] / δ f, by placing any unscheduled job q, q δ in position e + 1 of π, we
4 MOSIM 10 - May 10-12, Haaet - Tunisia create a descendant node {,,...,, q} δ q = δ δ δ. [ 1] [ 2] [ e] Our branch and bound algorith eploys an adaptive depth-first plus bactracing search strategy and uses a lower bound to fatho nodes. We calculate the lower bound for each created nodes such that the nuber of created nodes are always less than or equal to N. The node to be branched is selected aong the recently created nodes which has the iniu lower bound. The nodes with lower bounds that are saller than the current incubent solution are interesting for further consideration such that the initial incubent solution is the solution obtained by our genetic algorith. We develop a useful achine-based lower bound. To copute a lower bound of the aespan for each node of the search tree, we suppose that only one achine; ( = 1,..., M ) can process at ost one job at a tie and the reainder achines can handle at the sae tie an infinite nuber of jobs. By this relaxation, the proble is transfored to sequence a set of jobs on a one achine with release dates (heads) and delivery ties (tails). Thus, we calculate a lower bound on the aespan by solving a single-achine scheduling proble. In order to calculate a lower bound the ain idea is that a job within a faily f can be processed at a achine only when both the job and the achine are ready. Let: C( q, ) The copletion tie of job q on achine. With q is the last scheduled job within the faily sequenced in position f. And in P ji Z j / q l, = δ i= l for 1 l M 0 otherwise Then lb = C( q, ) + Z + P for = 1,2,...,. [ ], 1 f j j δ / q Hence, a valid lower bound on the copletion tie on achine of the last sequenced jobs within the faily sequenced in position f of π. lb = ax lb 1 We define by C ' ( δ [ ][ ], ) the lower bound value of the f j copletion tie of the job in position j within the faily sequenced in position f on achine. Then C ' ( δ,0) = 0 for = f + 1, f + 2,..., K. [ ][ j] C = lb + S + P. ' 1 ( δ +,1) [ f 1][ 1] [ f 1] [ f 1][ 1] ' ' C ( δ[ ][ ], ) = ax lb S[ ][ 1], C ( δ[ 1][ 1], 1) + P f + f f + f + f for = 2,3,..., M. ' ' ' C ( δ[ ][ ], ) = ax C ( δ 1 [ 1], ) + S[ 1][ ], C ( δ[ ][ 1], 1) + P N 1 [ 1] for = f + 2, f + 3,..., K and = 1,2,..., M. C ( δ, ) = ax C ( δ, 1), C ( δ, ) + P ' ' ' [ ][ j] [ ][ j] [ ][ j 1] j for j = 2,3,..., N[ ], = f + 1, f + 2,..., K and = 1,2,..., M. So, the lower bound value of the copletion tie of the last job in the last faily on achine M is obtained by C ' (, M ) δ[ K ] N [ K ] 4 COMPUTATIONAL RESULTS Several tests were carried out to evaluate the effectiveness and the efficiency of our cooperative approach. In our ipleentation, we use the test probles tested by Schaller et al. (2000), França et al. (2005) and Lin et al. (2009) for the sae proble. In total, there are 900 instance probles classified into three classes according to the range of setup ties naed "Sall Setups" (SSU), "Mediu Setups" (MSU) and "Large Setups" (LSU). A Detailed description of these proble tests is given in (Schaller et al., 2000) and França et al. (2005). The algorith was coded in C++ and run on a PC with Pentiu 4, 3 GHz processor, with 512 Mb of RAM. The paraeter settings were deterined by preliinary job tests as follows: P = 40, p cross =0.5, the probability α varies according to the class of instances. Thus, α is equal to 0.3 4K, and respectively for LSU, MSU 2K K and SSU classes. The paraeter ηax is set to N f 50. For each class of instances, we define a perforance easure of each algorith by the average relative percentage of iproveents 30 M ij LBi i= 1 LBi avg = 100 of 30 the aespan for the instance i obtained by the heuristic algorith j ( ) ij M with respect to the lower bound values of Schaller et al. (2000). in and ax denote, respectively, the iniu and the axiu relative percentage of iproveents over each class of instances. t avg reports the average CPU ties of different algoriths in seconds. We perfor a coparison of the proposed cooperative approach (GA-B&B) with the other proposed algoriths in the literature and the results are displayed in Table 1 and Table2. Table1 provides results fro evolutionary algoriths including our proposed algorith; the first colun illustrated the results of the Meetic Algorith (MA) of França et al. (2005), the second and the third colun represents respectively the results of the genetic algorith of Lin et al. (2009) and our proposed algorith. Table 2 illustrates the results obtained fro local search algorith that is results of Tabu search algorith (TS(2)) of Hendizadeh et al. (2008) into the first colun, results of Siulated Annealing (SA) and Tabu search algorith (TS(1)) developed both by Lin et al. (2009) respectively into the second and third colun.
5 MOSIM 10 - May 10-12, Haaet - Tunisia Table 1 iplies that, on average for all tested instances, GA-B&B obtains the best results both on in, avg and ax. In other words, the Branch and Bound algorith can iprove the perforance of the Genetic Algorith. So, by coparing our approach against the Meetic algorith of França et al. (2005), where a siple local search procedure is added to the GA, it sees, on average that our algorith GA&BB is better than MA. Therefore, it s ore suitable to ebed an exact algorith into the GA. Moreover, in Table 2, it s shown that the results provided by GA&BB are better than the results of tabu search algoriths (TS(1) and TS(2) in ters of solution quality according to the eployed perforance easure.. Besides, when regarding the results of the SA of Lin et al. (2009), it s seen that the perforances of our approach and SA are very close. Although, in ters of in and avg these two algoriths are siilar, SA is better than GA&BB in ters of ax. About the CPU ties, we cannot conclude uch inforation because of the PC configurations used for the different approaches. However, the coputational effort of our algorith sees to be short. TS(2) SA TS(1) in avg ax t avg in avg ax t avg in avg ax t avg LSU LSU LSU LSU LSU LSU LSU LSU LSU LSU MSU MSU MSU MSU MSU MSU MSU MSU MSU MSU SSU SSU SSU SSU SSU SSU SSU SSU SSU SSU all Table 1: Coputational results of Tabu Search and Siulated Annealing algoriths
6 MOSIM 10 - May 10-12, Haaet - Tunisia instances MA GA GA&BB in avg ax t avg in avg ax t avg in avg ax t avg LSU LSU LSU LSU LSU LSU LSU LSU LSU LSU MSU MSU MSU MSU MSU MSU MSU MSU MSU MSU SSU SSU SSU SSU SSU SSU SSU SSU SSU SSU all Table 2: Coputational results of genetic and eetic algoriths
7 MOSIM 10 - May 10-12, Haaet - Tunisia 5 CONCLUSION In this paper a cooperative approach which integrates a Branch and Bound algorith, as an iproveent procedure, into a Genetic Algorith is presented. The addressed proble is the perutation flowline anufacturing cell with sequence dependent faily setup ties while iniizing the aespan criterion. The Branch and Bound algorith decoposes the whole proble by considering, in each faily, the probleas perutation flowshop scheduling proble with achine availability constraint. The experiental results, based on the used proble tests, show that our algorith provided good results and our approach is better than other approaches which cooperated between evolutionary algoriths and local search procedure. REFERENCES setup ties. Coputers and Operations Research ;36; Lozanoa M, Garcia-Martinez C., Hybrid etaheuristics with evolutionary algoriths specializing in intensification and diversification: Overview and progress report. Coputers and Operations Research; 37: Nawaz M., Enscore E., Ha I., A heuristic algorith for the -achine, n-job flow shop sequencing proble. OMEGA, International Journal of Manageent Science; 11: Ruiz R, Maroto C, Alcaraz J., Two new robust genetic algoriths for the flowshop scheduling proble. OMEGA, International Journal of Manageent Science ;34: Schaller JE, Gupta JND, Vaharia AJ., Scheduling a flowline anufacturing cell with sequence dependent faily setup ties. European Journal of Operational Research;125: Blu C., Hybrid Metaheuristics. Coputers and Operations Research; 37: Capbell, HG, Dude RA, Sith ML, A heuristic algorith for the n-job, -achine sequencing proble. Manageent Science; 16 : Cheng TCE, Gupta JND, Wang G., A review of flowshop scheduling research with setup ties. Production and Operations Manageent ;9: França PM, Gupta JND, Mendes AS, Moscato P, Veltin K., Evolutionary algoriths for scheduling a flowshop anufacturing cell with sequence dependent faily setups. Coputers and Industrial Engineering;48: Garey MR, Johnson DS., Coputers and Intractability: A Guide to the Theory of NP- Copleteness, Freean, San Francisco, CA. Greene TJ, Sadowsi RP., A review of cellular anufacturing assuptions, advantages and design techniques. Journal of Operations Manageent; 4: Hendizadeh SH, Faraarzi H, Mansouri SA, Gupta JND, ElMeawy TY., Meta-heuristics for scheduling a flowline anufacturing cell with sequence dependent faily setup ties. International Journal of Production Econoics;111: Jarboui B, Ibrahi S, Siarry P, Rebai A., A cobinatorial particle swar optiisation for solving perutation flowshop probles. Coputers and Industrial Engineering;54: Jourdan L, Basseur M, Talbi EG., Hybridizing exact ethods and etaheuristics: A taxonoy. European Journal of Operational Research; 199: Lin S-W, Ying K-C, Lee Z-J., Metaheuristics for scheduling a non-perutation flowline anufacturing cell with sequence dependent faily
List Scheduling and LPT Oliver Braun (09/05/2017)
List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)
More informatione-companion ONLY AVAILABLE IN ELECTRONIC FORM
OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer
More informationAn improved self-adaptive harmony search algorithm for joint replenishment problems
An iproved self-adaptive harony search algorith for joint replenishent probles Lin Wang School of Manageent, Huazhong University of Science & Technology zhoulearner@gail.co Xiaojian Zhou School of Manageent,
More informationHomework 3 Solutions CSE 101 Summer 2017
Hoework 3 Solutions CSE 0 Suer 207. Scheduling algoriths The following n = 2 jobs with given processing ties have to be scheduled on = 3 parallel and identical processors with the objective of iniizing
More informationInternational Journal on Recent and Innovation Trends in Computing and Communication ISSN: Volume: 5 Issue:
Optial Specially Structured N X 2 Flow Shop Scheduling To Miniize Total Waiting Tie of Jobs ncluding Job Block Concept with Processing Tie Separated Fro Set up Tie Dr Deepak Gupta Professor & Head Departent
More informationtime time δ jobs jobs
Approxiating Total Flow Tie on Parallel Machines Stefano Leonardi Danny Raz y Abstract We consider the proble of optiizing the total ow tie of a strea of jobs that are released over tie in a ultiprocessor
More informationA Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness
A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,
More informationFLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES
Journal of the Operations Research Society of Japan Vo!. 29, No. 3, Septeber 1986 1986 The Operations Research Society of Japan FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES Jatinder N. D. Gupta
More informationA New Approach to Solving Dynamic Traveling Salesman Problems
A New Approach to Solving Dynaic Traveling Salesan Probles Changhe Li 1 Ming Yang 1 Lishan Kang 1 1 China University of Geosciences(Wuhan) School of Coputer 4374 Wuhan,P.R.China lchwfx@yahoo.co,yanging72@gail.co,ang_whu@yahoo.co
More informationAdapting the Pheromone Evaporation Rate in Dynamic Routing Problems
Adapting the Pheroone Evaporation Rate in Dynaic Routing Probles Michalis Mavrovouniotis and Shengxiang Yang School of Coputer Science and Inforatics, De Montfort University The Gateway, Leicester LE1
More informationGenetic Quantum Algorithm and its Application to Combinatorial Optimization Problem
Genetic Quantu Algorith and its Application to Cobinatorial Optiization Proble Kuk-Hyun Han Dept. of Electrical Engineering, KAIST, 373-, Kusong-dong Yusong-gu Taejon, 305-70, Republic of Korea khhan@vivaldi.kaist.ac.kr
More informationEMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS
EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS Jochen Till, Sebastian Engell, Sebastian Panek, and Olaf Stursberg Process Control Lab (CT-AST), University of Dortund,
More informationApproximation in Stochastic Scheduling: The Power of LP-Based Priority Policies
Approxiation in Stochastic Scheduling: The Power of -Based Priority Policies Rolf Möhring, Andreas Schulz, Marc Uetz Setting (A P p stoch, r E( w and (B P p stoch E( w We will assue that the processing
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More informationInteractive Markov Models of Evolutionary Algorithms
Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary
More informationAlgorithms for parallel processor scheduling with distinct due windows and unit-time jobs
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and
More informationNew Slack-Monotonic Schedulability Analysis of Real-Time Tasks on Multiprocessors
New Slack-Monotonic Schedulability Analysis of Real-Tie Tasks on Multiprocessors Risat Mahud Pathan and Jan Jonsson Chalers University of Technology SE-41 96, Göteborg, Sweden {risat, janjo}@chalers.se
More informationGenetic Algorithm Search for Stent Design Improvements
Genetic Algorith Search for Stent Design Iproveents K. Tesch, M.A. Atherton & M.W. Collins, South Bank University, London, UK Abstract This paper presents an optiisation process for finding iproved stent
More informationŞtefan ŞTEFĂNESCU * is the minimum global value for the function h (x)
7Applying Nelder Mead s Optiization Algorith APPLYING NELDER MEAD S OPTIMIZATION ALGORITHM FOR MULTIPLE GLOBAL MINIMA Abstract Ştefan ŞTEFĂNESCU * The iterative deterinistic optiization ethod could not
More informationBipartite subgraphs and the smallest eigenvalue
Bipartite subgraphs and the sallest eigenvalue Noga Alon Benny Sudaov Abstract Two results dealing with the relation between the sallest eigenvalue of a graph and its bipartite subgraphs are obtained.
More informationRandomized Recovery for Boolean Compressed Sensing
Randoized Recovery for Boolean Copressed Sensing Mitra Fatei and Martin Vetterli Laboratory of Audiovisual Counication École Polytechnique Fédéral de Lausanne (EPFL) Eail: {itra.fatei, artin.vetterli}@epfl.ch
More informationarxiv: v1 [cs.ds] 3 Feb 2014
arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/
More informationOn Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40
On Poset Merging Peter Chen Guoli Ding Steve Seiden Abstract We consider the follow poset erging proble: Let X and Y be two subsets of a partially ordered set S. Given coplete inforation about the ordering
More informationASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical
IEEE TRANSACTIONS ON INFORMATION THEORY Large Alphabet Source Coding using Independent Coponent Analysis Aichai Painsky, Meber, IEEE, Saharon Rosset and Meir Feder, Fellow, IEEE arxiv:67.7v [cs.it] Jul
More informationConvex Programming for Scheduling Unrelated Parallel Machines
Convex Prograing for Scheduling Unrelated Parallel Machines Yossi Azar Air Epstein Abstract We consider the classical proble of scheduling parallel unrelated achines. Each job is to be processed by exactly
More informationWorst-case performance of critical path type algorithms
Intl. Trans. in Op. Res. 7 (2000) 383±399 www.elsevier.co/locate/ors Worst-case perforance of critical path type algoriths G. Singh, Y. Zinder* University of Technology, P.O. Box 123, Broadway, NSW 2007,
More informationSequence Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson) February 5,
Sequence Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson) February 5, 2015 31 11 Motif Finding Sources for this section: Rouchka, 1997, A Brief Overview of Gibbs Sapling. J. Buhler, M. Topa:
More informationOn the Analysis of the Quantum-inspired Evolutionary Algorithm with a Single Individual
6 IEEE Congress on Evolutionary Coputation Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 16-1, 6 On the Analysis of the Quantu-inspired Evolutionary Algorith with a Single Individual
More informationAnalyzing Simulation Results
Analyzing Siulation Results Dr. John Mellor-Cruey Departent of Coputer Science Rice University johnc@cs.rice.edu COMP 528 Lecture 20 31 March 2005 Topics for Today Model verification Model validation Transient
More informationGradient-Based Cuckoo Search for Global Optimization
Instituto Tecnologico de Aguascalientes Fro the SelectedWorks of Adrian Bonilla-Petriciolet 4 Gradient-Based Cuckoo Search for Global Optiization Seif E.K. Fateen, Cairo University Adrian Bonilla-Petriciolet
More informationDefect-Aware SOC Test Scheduling
Defect-Aware SOC Test Scheduling Erik Larsson +, Julien Pouget*, and Zebo Peng + Ebedded Systes Laboratory + LIRMM* Departent of Coputer Science Montpellier 2 University Linköpings universitet CNRS Sweden
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More informationMSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE
Proceeding of the ASME 9 International Manufacturing Science and Engineering Conference MSEC9 October 4-7, 9, West Lafayette, Indiana, USA MSEC9-8466 MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL
More informationHybrid System Identification: An SDP Approach
49th IEEE Conference on Decision and Control Deceber 15-17, 2010 Hilton Atlanta Hotel, Atlanta, GA, USA Hybrid Syste Identification: An SDP Approach C Feng, C M Lagoa, N Ozay and M Sznaier Abstract The
More informationA Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science
A Better Algorith For an Ancient Scheduling Proble David R. Karger Steven J. Phillips Eric Torng Departent of Coputer Science Stanford University Stanford, CA 9435-4 Abstract One of the oldest and siplest
More informationA Simple Regression Problem
A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where
More informationA Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay
A Low-Coplexity Congestion Control and Scheduling Algorith for Multihop Wireless Networks with Order-Optial Per-Flow Delay Po-Kai Huang, Xiaojun Lin, and Chih-Chun Wang School of Electrical and Coputer
More informationOptimal Resource Allocation in Multicast Device-to-Device Communications Underlaying LTE Networks
1 Optial Resource Allocation in Multicast Device-to-Device Counications Underlaying LTE Networks Hadi Meshgi 1, Dongei Zhao 1 and Rong Zheng 2 1 Departent of Electrical and Coputer Engineering, McMaster
More informationSupport Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization
Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationOn the Inapproximability of Vertex Cover on k-partite k-uniform Hypergraphs
On the Inapproxiability of Vertex Cover on k-partite k-unifor Hypergraphs Venkatesan Guruswai and Rishi Saket Coputer Science Departent Carnegie Mellon University Pittsburgh, PA 1513. Abstract. Coputing
More informationSharp Time Data Tradeoffs for Linear Inverse Problems
Sharp Tie Data Tradeoffs for Linear Inverse Probles Saet Oyak Benjain Recht Mahdi Soltanolkotabi January 016 Abstract In this paper we characterize sharp tie-data tradeoffs for optiization probles used
More informationA Generalized Permanent Estimator and its Application in Computing Multi- Homogeneous Bézout Number
Research Journal of Applied Sciences, Engineering and Technology 4(23): 5206-52, 202 ISSN: 2040-7467 Maxwell Scientific Organization, 202 Subitted: April 25, 202 Accepted: May 3, 202 Published: Deceber
More informationExperimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis
City University of New York (CUNY) CUNY Acadeic Works International Conference on Hydroinforatics 8-1-2014 Experiental Design For Model Discriination And Precise Paraeter Estiation In WDS Analysis Giovanna
More informationREAL-TIME SCHEDULING AND CONTROL OF A FLOW-SHOP USING DIOID ALGEBRA
REAL-TIME SCHEDULING AND CONTROL OF A FLOW-SHOP USING DIOID ALGEBRA Mustafa YURDAKUL Assistant Professor, Departent of Mechanical Engineering, Faculty of Engineering and Architecture, Gazi University,
More informationOBJECTIVES INTRODUCTION
M7 Chapter 3 Section 1 OBJECTIVES Suarize data using easures of central tendency, such as the ean, edian, ode, and idrange. Describe data using the easures of variation, such as the range, variance, and
More informationSpine Fin Efficiency A Three Sided Pyramidal Fin of Equilateral Triangular Cross-Sectional Area
Proceedings of the 006 WSEAS/IASME International Conference on Heat and Mass Transfer, Miai, Florida, USA, January 18-0, 006 (pp13-18) Spine Fin Efficiency A Three Sided Pyraidal Fin of Equilateral Triangular
More informationStochastic Optimization of Product-Machine Qualification in a Semiconductor Back-end Facility
Stochastic Optiization of Product-Machine Qualification in a Seiconductor Back-end Facility Mengying Fu, Ronald Askin, John Fowler, Muhong Zhang School of Coputing, Inforatics, and Systes Engineering,
More informationDepartment of Electronic and Optical Engineering, Ordnance Engineering College, Shijiazhuang, , China
6th International Conference on Machinery, Materials, Environent, Biotechnology and Coputer (MMEBC 06) Solving Multi-Sensor Multi-Target Assignent Proble Based on Copositive Cobat Efficiency and QPSO Algorith
More informationPAPER Approach to the Unit Maintenance Scheduling Decision Using Risk Assessment and Evolution Programming Techniques
1900 PAPER Approach to the Unit Maintenance Scheduling Decision Using Risk Assessent and Evolution Prograing Techniques Chen-Sung CHANG a), Meber SUMMARY This paper applies the Evolutionary Prograing (EP)
More informationKeywords: Estimator, Bias, Mean-squared error, normality, generalized Pareto distribution
Testing approxiate norality of an estiator using the estiated MSE and bias with an application to the shape paraeter of the generalized Pareto distribution J. Martin van Zyl Abstract In this work the norality
More informationKernel Methods and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic
More informationEuropean Journal of Operational Research
European Journal of Operational Research 196 (2009) 171 176 Contents lists available at ScienceDirect European Journal of Operational Research journal hoepage: www.elsevier.co/locate/ejor Production, Manufacturing
More informationIntelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes
More informationCh 12: Variations on Backpropagation
Ch 2: Variations on Backpropagation The basic backpropagation algorith is too slow for ost practical applications. It ay take days or weeks of coputer tie. We deonstrate why the backpropagation algorith
More informationCOS 424: Interacting with Data. Written Exercises
COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well
More informationRandomized Accuracy-Aware Program Transformations For Efficient Approximate Computations
Randoized Accuracy-Aware Progra Transforations For Efficient Approxiate Coputations Zeyuan Allen Zhu Sasa Misailovic Jonathan A. Kelner Martin Rinard MIT CSAIL zeyuan@csail.it.edu isailo@it.edu kelner@it.edu
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationReduced Length Checking Sequences
Reduced Length Checing Sequences Robert M. Hierons 1 and Hasan Ural 2 1 Departent of Inforation Systes and Coputing, Brunel University, Middlesex, UB8 3PH, United Kingdo 2 School of Inforation echnology
More information1 Identical Parallel Machines
FB3: Matheatik/Inforatik Dr. Syaantak Das Winter 2017/18 Optiizing under Uncertainty Lecture Notes 3: Scheduling to Miniize Makespan In any standard scheduling proble, we are given a set of jobs J = {j
More informationOn the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation
journal of coplexity 6, 459473 (2000) doi:0.006jco.2000.0544, available online at http:www.idealibrary.co on On the Counication Coplexity of Lipschitzian Optiization for the Coordinated Model of Coputation
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationWhen Short Runs Beat Long Runs
When Short Runs Beat Long Runs Sean Luke George Mason University http://www.cs.gu.edu/ sean/ Abstract What will yield the best results: doing one run n generations long or doing runs n/ generations long
More informationLongest Processing Time rule for identical parallel machines revisited
Longest Processing Tie rule for identical parallel achines revisited Federico Della Croce a,b,, Rosario Scataacchia a arxiv:1801.05489v1 [cs.ds] 16 Jan 2018 a Dipartiento di Ingegneria Gestionale e della
More informationThe Algorithms Optimization of Artificial Neural Network Based on Particle Swarm
Send Orders for Reprints to reprints@benthascience.ae The Open Cybernetics & Systeics Journal, 04, 8, 59-54 59 Open Access The Algoriths Optiization of Artificial Neural Network Based on Particle Swar
More informationA Note on Online Scheduling for Jobs with Arbitrary Release Times
A Note on Online Scheduling for Jobs with Arbitrary Release Ties Jihuan Ding, and Guochuan Zhang College of Operations Research and Manageent Science, Qufu Noral University, Rizhao 7686, China dingjihuan@hotail.co
More informationOn Constant Power Water-filling
On Constant Power Water-filling Wei Yu and John M. Cioffi Electrical Engineering Departent Stanford University, Stanford, CA94305, U.S.A. eails: {weiyu,cioffi}@stanford.edu Abstract This paper derives
More informationCombining Classifiers
Cobining Classifiers Generic ethods of generating and cobining ultiple classifiers Bagging Boosting References: Duda, Hart & Stork, pg 475-480. Hastie, Tibsharini, Friedan, pg 246-256 and Chapter 10. http://www.boosting.org/
More informationRecovering Data from Underdetermined Quadratic Measurements (CS 229a Project: Final Writeup)
Recovering Data fro Underdeterined Quadratic Measureents (CS 229a Project: Final Writeup) Mahdi Soltanolkotabi Deceber 16, 2011 1 Introduction Data that arises fro engineering applications often contains
More informationOrder Sequencing and Capacity Balancing in Synchronous Manufacturing
Order Sequencing and Capacity Balancing in Synchronous Manufacturing Jan Riezebos To cite this version: Jan Riezebos. Order Sequencing and Capacity Balancing in Synchronous Manufacturing. International
More informationA Markov Framework for the Simple Genetic Algorithm
A arkov Fraework for the Siple Genetic Algorith Thoas E. Davis*, Jose C. Principe Electrical Engineering Departent University of Florida, Gainesville, FL 326 *WL/NGS Eglin AFB, FL32542 Abstract This paper
More informationPredicting FTSE 100 Close Price Using Hybrid Model
SAI Intelligent Systes Conference 2015 Noveber 10-11, 2015 London, UK Predicting FTSE 100 Close Price Using Hybrid Model Bashar Al-hnaity, Departent of Electronic and Coputer Engineering, Brunel University
More informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course Notes for EE227C (Spring 2018): Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee227c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee227c@berkeley.edu October
More informationLONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES
Journal of Marine Science and Technology, Vol 19, No 5, pp 509-513 (2011) 509 LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES Ming-Tao Chou* Key words: fuzzy tie series, fuzzy forecasting,
More informationUniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval
Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,
More informationAccuracy of the Scaling Law for Experimental Natural Frequencies of Rectangular Thin Plates
The 9th Conference of Mechanical Engineering Network of Thailand 9- October 005, Phuket, Thailand Accuracy of the caling Law for Experiental Natural Frequencies of Rectangular Thin Plates Anawat Na songkhla
More informationFairness via priority scheduling
Fairness via priority scheduling Veeraruna Kavitha, N Heachandra and Debayan Das IEOR, IIT Bobay, Mubai, 400076, India vavitha,nh,debayan}@iitbacin Abstract In the context of ulti-agent resource allocation
More informationTCSC PLACEMENT FOR LOSS MINIMISATION USING SELF ADAPTIVE FIREFLY ALGORITHM
Journal of Engineering Science and Technology Vol. 10, No. 3 (2015) 21-306 School of Engineering, Taylor s University PLACEMENT FOR LOSS MINIMISATION USING SELF ADAPTIVE FIREFLY ALGORITHM R. SELVARASU*,
More informationScheduling Contract Algorithms on Multiple Processors
Fro: AAAI Technical Report FS-0-04. Copilation copyright 200, AAAI (www.aaai.org). All rights reserved. Scheduling Contract Algoriths on Multiple Processors Daniel S. Bernstein, Theodore. Perkins, Shloo
More informationMULTIAGENT Resource Allocation (MARA) is the
EDIC RESEARCH PROPOSAL 1 Designing Negotiation Protocols for Utility Maxiization in Multiagent Resource Allocation Tri Kurniawan Wijaya LSIR, I&C, EPFL Abstract Resource allocation is one of the ain concerns
More informationA general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics, EPFL, Lausanne Phone: Fax:
A general forulation of the cross-nested logit odel Michel Bierlaire, EPFL Conference paper STRC 2001 Session: Choices A general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics,
More informationDesign of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding
IEEE TRANSACTIONS ON INFORMATION THEORY (SUBMITTED PAPER) 1 Design of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding Lai Wei, Student Meber, IEEE, David G. M. Mitchell, Meber, IEEE, Thoas
More informationarxiv: v3 [cs.ds] 22 Mar 2016
A Shifting Bloo Filter Fraewor for Set Queries arxiv:1510.03019v3 [cs.ds] Mar 01 ABSTRACT Tong Yang Peing University, China yangtongeail@gail.co Yuanun Zhong Nanjing University, China un@sail.nju.edu.cn
More informationUpper bound on false alarm rate for landmine detection and classification using syntactic pattern recognition
Upper bound on false alar rate for landine detection and classification using syntactic pattern recognition Ahed O. Nasif, Brian L. Mark, Kenneth J. Hintz, and Nathalia Peixoto Dept. of Electrical and
More informationIEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 60, NO. 2, FEBRUARY ETSP stands for the Euclidean traveling salesman problem.
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 60, NO., FEBRUARY 015 37 Target Assignent in Robotic Networks: Distance Optiality Guarantees and Hierarchical Strategies Jingjin Yu, Meber, IEEE, Soon-Jo Chung,
More informationIAENG International Journal of Computer Science, 42:2, IJCS_42_2_06. Approximation Capabilities of Interpretable Fuzzy Inference Systems
IAENG International Journal of Coputer Science, 4:, IJCS_4 6 Approxiation Capabilities of Interpretable Fuzzy Inference Systes Hirofui Miyajia, Noritaka Shigei, and Hiroi Miyajia 3 Abstract Many studies
More informationOPTIMIZATION in multi-agent networks has attracted
Distributed constrained optiization and consensus in uncertain networks via proxial iniization Kostas Margellos, Alessandro Falsone, Sione Garatti and Maria Prandini arxiv:603.039v3 [ath.oc] 3 May 07 Abstract
More informationThis model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.
CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when
More informationarxiv: v1 [cs.ds] 17 Mar 2016
Tight Bounds for Single-Pass Streaing Coplexity of the Set Cover Proble Sepehr Assadi Sanjeev Khanna Yang Li Abstract arxiv:1603.05715v1 [cs.ds] 17 Mar 2016 We resolve the space coplexity of single-pass
More informationRecursive Algebraic Frisch Scheme: a Particle-Based Approach
Recursive Algebraic Frisch Schee: a Particle-Based Approach Stefano Massaroli Renato Myagusuku Federico Califano Claudio Melchiorri Atsushi Yaashita Hajie Asaa Departent of Precision Engineering, The University
More informationUsing a De-Convolution Window for Operating Modal Analysis
Using a De-Convolution Window for Operating Modal Analysis Brian Schwarz Vibrant Technology, Inc. Scotts Valley, CA Mark Richardson Vibrant Technology, Inc. Scotts Valley, CA Abstract Operating Modal Analysis
More informationStochastic Machine Scheduling with Precedence Constraints
Stochastic Machine Scheduling with Precedence Constraints Martin Skutella Fakultät II, Institut für Matheatik, Sekr. MA 6-, Technische Universität Berlin, 0623 Berlin, Gerany skutella@ath.tu-berlin.de
More informationStochastic Subgradient Methods
Stochastic Subgradient Methods Lingjie Weng Yutian Chen Bren School of Inforation and Coputer Science University of California, Irvine {wengl, yutianc}@ics.uci.edu Abstract Stochastic subgradient ethods
More informationGrafting: Fast, Incremental Feature Selection by Gradient Descent in Function Space
Journal of Machine Learning Research 3 (2003) 1333-1356 Subitted 5/02; Published 3/03 Grafting: Fast, Increental Feature Selection by Gradient Descent in Function Space Sion Perkins Space and Reote Sensing
More informationExtension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels
Extension of CSRSM for the Paraetric Study of the Face Stability of Pressurized Tunnels Guilhe Mollon 1, Daniel Dias 2, and Abdul-Haid Soubra 3, M.ASCE 1 LGCIE, INSA Lyon, Université de Lyon, Doaine scientifique
More informationIn this chapter, we consider several graph-theoretic and probabilistic models
THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions
More informationEffective joint probabilistic data association using maximum a posteriori estimates of target states
Effective joint probabilistic data association using axiu a posteriori estiates of target states 1 Viji Paul Panakkal, 2 Rajbabu Velurugan 1 Central Research Laboratory, Bharat Electronics Ltd., Bangalore,
More information13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationThe Frequent Paucity of Trivial Strings
The Frequent Paucity of Trivial Strings Jack H. Lutz Departent of Coputer Science Iowa State University Aes, IA 50011, USA lutz@cs.iastate.edu Abstract A 1976 theore of Chaitin can be used to show that
More informationCorrelated Bayesian Model Fusion: Efficient Performance Modeling of Large-Scale Tunable Analog/RF Integrated Circuits
Correlated Bayesian odel Fusion: Efficient Perforance odeling of Large-Scale unable Analog/RF Integrated Circuits Fa Wang and Xin Li ECE Departent, Carnegie ellon University, Pittsburgh, PA 53 {fwang,
More information