The Greedy Method. Introduction. 0/1 Knapsack Problem


 Virginia Dean
 1 years ago
 Views:
Transcription
1 The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton problem, we are gven a set of constrants and an optmzaton functon. o Solutons that satsfy the constrants are called feasble solutons. o A feasble soluton for whch the optmzaton functon has the best possble value s called an optmal soluton. Cheapest lunch possble: Works by gettng the cheapest meat, frut, vegetable, etc. In a greedy method we attempt to construct an optmal soluton n stages. o At each stage we make a decson that appears to be the best (under some crteron) at the tme. o A decson made at one stage s not changed n a later stage, so each decson should assure feasblty. Consder gettng the best major: What s best now, may be worst later. Consder change makng: Gven a con system and an amount to make change for, we want mnmal number of cons. o A greedy crteron could be, at each stage ncrease the total amount of change constructed as much as possble. In other words, always pck the con wth the greatest value at every step. o A greedy soluton s optmal for some change systems. Machne schedulng: o Have a number of jobs to be done on a mnmum number of machnes. Each job has a start and end tme. o Order jobs by start tme. o If an old machne becomes avalable by the start tme of the task to be assgned, assgn the task to ths machne; f not assgn t to a new machne. o Ths s an optmal soluton. Note that our Huffman tree algorthm s an example of a greedy algorthm: o Pck least weght trees to combne. Heurstc we are not wllng to take the tme to get an optmal soluton, but we can be satsfed wth a pretty good soluton. 0/1 Knapsack Problem Problem descrpton: o Pack a knapsack wth a capacty of c. The Greedy Method Page 1
2 o From a lst of n tems, we must select the tems that are to be packed n the knapsack. o Each object has a weght of w and a proft of p. In a feasble knapsack packng, the sum of the weghts packed does not exceed the knapsack capacty. n An optmal packng s a feasble one wth maxmum proft p x subject to the constrants w x c n = 1 and { 0,1}, 1 n x o We are to fnd the values of x where x = 1 f object s packed nto the knapsack and x = 0 f object s not packed. Greedy strateges for ths problem: o From the remanng objects, select the object wth maxmum proft that fts nto the knapsack. o From the remanng objects, select the one that has mnmum weght and also fts nto the knapsack. o From the remanng objects, select the one wth maxmum p / w that fts nto the knapsack. Consder a knapsack nstance where n = 4, w = [ 2, 4,6,7], p = [ 6,10,12,13], and c = 11. o Look at the above three strateges. None of the above algorthms can guarantee the optmal soluton. o Ths s not surprsng snce ths problem s a NPhard problem. Of the above three algorthms, the thrd one s probably the best heurstc. = 1 Topologcal Orderng Greedy crtera for the unnumbered nodes, assgn a number to a node for whch all predecessors have been numbered. Algorthm Intally, for each node wth predecessor count of zero, put t n a contaner (stack, queue, anythng wll do). 1. Remove a node wth predecessor count of zero from the contaner, number t, then lst t. 2. For each successor, decrement ts predecessor count. 3. If a successor now has a predecessor count of zero, add t to the contaner. Complexty assume an adjacency lst. 1. Fnd predecessor count. Ο (e), where e s number of edges. 2. Lst node for each successor, update predecessor count. Ο ( e + n), snce f have lots of nodes wth no predecessors, n could be more than e. Matchngs and Coverngs n a Graph The Greedy Method Page 2
3 Matchng a set of edges, no two of whch have a vertex n common. A perfect match s one n whch all vertces are matched. A maxmum matchng s matchng that cannot be extended by the addton of an edge. For an example see Fgure 1. Fgure 1 Matchng Many problems that seem unrelated to matchng can be formulated ths way. Edge coverng fnd mnmum number of edges (not necessarly ndependent) to cover (touch) all vertces. Stable marrage problem we want to fnd a matchng such that there exsts no stuaton n whch two ndvduals would rather be matched wth each other than the people they are currently matched wth. Bpartte Cover Bpartte graph (two parts) two ndependent sets of vertces such that all edges are between elements of dfferent sets. Complete bpartte every vertex of one set s adjacent to every vertex of second set. Examples of bpartte graphs: o Wouldworkfor graph n whch one set of nodes s jobs and another set s employees. o Want to marry (n Utah) where the node sets are men and women. Cover a subset A' of the set A s sad to cover the set B ff every vertex n B s connected to at least one vertex of A'. o Sze of the cover the number of vertces n A'. o Mnmum cover there s no smaller subset of A that covers B. Bpartte cover gven two types of nodes X and Y, X' s a node cover f X' s a subset of X such that every node n Y s connected to a node n X' va an edge. We want the cover of the mnmum sze. The Greedy Method Page 3
4 A coverng for Fgure 2 s {1, 2, 3, 17}. Show the mnmum cover for the bpartte graph shown n Fgure 2. o The cover s {1, 16, 17}. Fgure 2 Bpartte Graph Examples: o Suppose you have a set of nterpreters and a set of languages that need to be nterpreted. Edges represent can nterpret. We want to fnd the mnmal number of nterpreters to hre so that you can nterpret all languages. o Set of people and a set of categores (male, Asan, CS major, sngle,...). We want to form a commttee wth representaton from all groups. Set cover gven a collecton of subsets, fnd a mnmum number of subsets such that ther unon s the unverse. o Can you see how to map ths problem to the bpartte cover problem? Nodes for each subset. Nodes for each element. Edges represent contans. Ths ablty to map one problem nto another s key to usng knowledge of algorthms communty. Ths s lkely the reason why I always try to fnd smlartes between thngs that seem dfferent (e.g., cleanng up for company). NPhard no one has developed a polynomal tme algorthm. o Also called ntractable or exponental. o We use greedy algorthms to approxmate. Greedy crteron Select the vertex of A that covers the largest number of uncovered vertces of B. Also keep a Boolean array that tells whether each node s covered or not. o Ths dea could be mplemented va a max tournament tree of wllcover take the bggest. Shortest Paths Gven a dgraph wth each edge n the graph havng a nonnegatve cost (or length). Try to fnd the shortest paths (n a dgraph) from a node to all other nodes. Greedy crteron From the vertces to whch the shortest path has not been generated, select one that results n the least path length (the smallest one). Have a reached set of nodes and an unreached set of nodes. 1. Intally, only the start node s reached. The Greedy Method Page 4
5 2. Use a mn prorty queue to store the total path lengths of each of the reached nodes to ts successors. 3. Whle prorty queue s not empty Pck the shortest total length node. If t has already been reached, dscard. Else count t as reached. Enqueue the total path lengths of each of the reached nodes to ts successors. For example, consder the dgraph Fgure 3 n and calculate the shortest path. Fgure 3 Shortest Path Mnmal Spannng Trees Problem select a subset of the edges such that a spannng tree s formed and the weght of the edges s mnmal. Example need to connect all stes to sewer system  want to mnmze the amount of ppe. Consder the spannng tree shown n Fgure 4. Fgure 4 Spannng Tree Prm s algorthm o Greedy crteron From the remanng edges, select a leastcost edge whose addton to the set of selected edges forms a tree. Tree set of vertces already n MST Succ set of vertces not n Tree but n Succ[Tree] Place any vertex (to serve as root) n MST. The Greedy Method Page 5
6 1. Fnd the smallest edge that connects Tree wth Succ 2. Add the edge to the MST and update Tree and Succ Uses a greedy method obtan a globally optmal soluton by means of a locally optmal soluton. Usng Fgure 4 and Prm s algorthm, we add the edges n the followng order: (1,6), (6,5), (5,4), (4,3), (3,2), and (2, 7). How do we fnd smallest edge? (sort or prorty queue) Kruskal s algorthm o Greedy crteron From the remanng edges, select a leastcost edge that does not result n a cycle when added to the set of already selected edges. Let each vertex be a separate component. 1. Examne each edge n ncreasng order of cost. 2. If edge connects vertces n same component, dscard t. Otherwse, add edge to MST. Update components. Usng Fgure 4 and Kruskal s algorthm, we add the edges n the followng order: (1,6), (3,4), (2,7), (2,3), (4,5), and (5,6). How do we fnd smallest edge? (sort or prorty queue) More Traversals of a Graph or Dgraph Tour vst each vertex n a graph exactly once and fnsh at the vertex started from. Euleran tour fnd a path/tour through the graph such that every edge s vsted exactly once. (Easy check nodal degree; f all are even, t s possble.) Hamltonan tour fnd a path through the graph such that every vertex s vsted exactly once. (NP complete) See Fgure 5 for dfferent tours. Fgure 5 Dfferent Tours The Greedy Method Page 6
1 Approximation Algorithms
CME 305: Dscrete Mathematcs and Algorthms 1 Approxmaton Algorthms In lght of the apparent ntractablty of the problems we beleve not to le n P, t makes sense to pursue deas other than complete solutons
More informationGraph Theory and Cayley s Formula
Graph Theory and Cayley s Formula Chad Casarotto August 10, 2006 Contents 1 Introducton 1 2 Bascs and Defntons 1 Cayley s Formula 4 4 Prüfer Encodng A Forest of Trees 7 1 Introducton In ths paper, I wll
More informationSolutions to the exam in SF2862, June 2009
Solutons to the exam n SF86, June 009 Exercse 1. Ths s a determnstc perodcrevew nventory model. Let n = the number of consdered wees,.e. n = 4 n ths exercse, and r = the demand at wee,.e. r 1 = r = r
More informationGeneralizing the degree sequence problem
Mddlebury College March 2009 Arzona State Unversty Dscrete Mathematcs Semnar The degree sequence problem Problem: Gven an nteger sequence d = (d 1,...,d n ) determne f there exsts a graph G wth d as ts
More informationPLANAR GRAPHS. Plane graph (or embedded graph) A graph that is drawn on the plane without edge crossing, is called a Plane graph
PLANAR GRAPHS Basc defntons Isomorphc graphs Two graphs G(V,E) and G2(V2,E2) are somorphc f there s a onetoone correspondence F of ther vertces such that the followng holds:  u,v V, uv E, => F(u)F(v)
More informationTo Fill or not to Fill: The Gas Station Problem
To Fll or not to Fll: The Gas Staton Problem Samr Khuller Azarakhsh Malekan Julán Mestre Abstract In ths paper we study several routng problems that generalze shortest paths and the Travelng Salesman Problem.
More informationFormulating & Solving Integer Problems Chapter 11 289
Formulatng & Solvng Integer Problems Chapter 11 289 The Optonal Stop TSP If we drop the requrement that every stop must be vsted, we then get the optonal stop TSP. Ths mght correspond to a ob sequencng
More information1 Example 1: Axisaligned rectangles
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton
More informationCommunication Networks II Contents
8 / 1  Communcaton Networs II (Görg)  www.comnets.unbremen.de Communcaton Networs II Contents 1 Fundamentals of probablty theory 2 Traffc n communcaton networs 3 Stochastc & Marovan Processes (SP
More informationPAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of IllinoisUrbana Champaign
PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of IllnosUrbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng
More informationFeature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
More informationHeuristic Static LoadBalancing Algorithm Applied to CESM
Heurstc Statc LoadBalancng Algorthm Appled to CESM 1 Yur Alexeev, 1 Sher Mckelson, 1 Sven Leyffer, 1 Robert Jacob, 2 Anthony Crag 1 Argonne Natonal Laboratory, 9700 S. Cass Avenue, Argonne, IL 60439,
More informationLuby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
More informationgreatest common divisor
4. GCD 1 The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no
More informationAn MILP model for planning of batch plants operating in a campaignmode
An MILP model for plannng of batch plants operatng n a campagnmode Yanna Fumero Insttuto de Desarrollo y Dseño CONICET UTN yfumero@santafeconcet.gov.ar Gabrela Corsano Insttuto de Desarrollo y Dseño
More informationINSTITUT FÜR INFORMATIK
INSTITUT FÜR INFORMATIK An EPTAS for schedulng jobs on unform processors: usng an MILP relaxaton wth a constant number of ntegral varables Klaus Jansen Bercht Nr. 1002 February 2010 CHRISTIANALBRECHTSUNIVERSITÄT
More information9.1 The Cumulative Sum Control Chart
Learnng Objectves 9.1 The Cumulatve Sum Control Chart 9.1.1 Basc Prncples: Cusum Control Chart for Montorng the Process Mean If s the target for the process mean, then the cumulatve sum control chart s
More informationEE201 Circuit Theory I 2015 Spring. Dr. Yılmaz KALKAN
EE201 Crcut Theory I 2015 Sprng Dr. Yılmaz KALKAN 1. Basc Concepts (Chapter 1 of Nlsson  3 Hrs.) Introducton, Current and Voltage, Power and Energy 2. Basc Laws (Chapter 2&3 of Nlsson  6 Hrs.) Voltage
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More informationGeneral Auction Mechanism for Search Advertising
General Aucton Mechansm for Search Advertsng Gagan Aggarwal S. Muthukrshnan Dávd Pál Martn Pál Keywords game theory, onlne auctons, stable matchngs ABSTRACT Internet search advertsng s often sold by an
More information+ + +   This circuit than can be reduced to a planar circuit
MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to
More informationCS 2750 Machine Learning. Lecture 3. Density estimation. CS 2750 Machine Learning. Announcements
Lecture 3 Densty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 5329 Sennott Square Next lecture: Matlab tutoral Announcements Rules for attendng the class: Regstered for credt Regstered for audt (only f there
More informationApproximation algorithms for allocation problems: Improving the factor of 1 1/e
Approxmaton algorthms for allocaton problems: Improvng the factor of 1 1/e Urel Fege Mcrosoft Research Redmond, WA 98052 urfege@mcrosoft.com Jan Vondrák Prnceton Unversty Prnceton, NJ 08540 jvondrak@gmal.com
More informationLogical Development Of Vogel s Approximation Method (LDVAM): An Approach To Find Basic Feasible Solution Of Transportation Problem
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME, ISSUE, FEBRUARY ISSN 77866 Logcal Development Of Vogel s Approxmaton Method (LD An Approach To Fnd Basc Feasble Soluton Of Transportaton
More informationThe Development of Web Log Mining Based on ImproveKMeans Clustering Analysis
The Development of Web Log Mnng Based on ImproveKMeans Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationProject Networks With MixedTime Constraints
Project Networs Wth MxedTme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More information1. Measuring association using correlation and regression
How to measure assocaton I: Correlaton. 1. Measurng assocaton usng correlaton and regresson We often would lke to know how one varable, such as a mother's weght, s related to another varable, such as a
More informationFigure 1. Inventory Level vs. Time  EOQ Problem
IEOR 54 Sprng, 009 rof Leahman otes on Eonom Lot Shedulng and Eonom Rotaton Cyles he Eonom Order Quantty (EOQ) Consder an nventory tem n solaton wth demand rate, holdng ost h per unt per unt tme, and replenshment
More informationLinear Regression, Regularization BiasVariance Tradeoff
HTF: Ch3, 7 B: Ch3 Lnear Regresson, Regularzaton BasVarance Tradeoff Thanks to C Guestrn, T Detterch, R Parr, N Ray 1 Outlne Lnear Regresson MLE = Least Squares! Bass functons Evaluatng Predctors Tranng
More informationNew bounds in BalogSzemerédiGowers theorem
New bounds n BalogSzemerédGowers theorem By Tomasz Schoen Abstract We prove, n partcular, that every fnte subset A of an abelan group wth the addtve energy κ A 3 contans a set A such that A κ A and A
More informationAvailabilityBased Path Selection and Network Vulnerability Assessment
AvalabltyBased Path Selecton and Network Vulnerablty Assessment Song Yang, Stojan Trajanovsk and Fernando A. Kupers Delft Unversty of Technology, The Netherlands {S.Yang, S.Trajanovsk, F.A.Kupers}@tudelft.nl
More informationJoint Scheduling of Processing and Shuffle Phases in MapReduce Systems
Jont Schedulng of Processng and Shuffle Phases n MapReduce Systems Fangfe Chen, Mural Kodalam, T. V. Lakshman Department of Computer Scence and Engneerng, The Penn State Unversty Bell Laboratores, AlcatelLucent
More informationA Computer Technique for Solving LP Problems with Bounded Variables
Dhaka Unv. J. Sc. 60(2): 163168, 2012 (July) A Computer Technque for Solvng LP Problems wth Bounded Varables S. M. Atqur Rahman Chowdhury * and Sanwar Uddn Ahmad Department of Mathematcs; Unversty of
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationSurvey on Virtual Machine Placement Techniques in Cloud Computing Environment
Survey on Vrtual Machne Placement Technques n Cloud Computng Envronment Rajeev Kumar Gupta and R. K. Paterya Department of Computer Scence & Engneerng, MANIT, Bhopal, Inda ABSTRACT In tradtonal data center
More informationINSTITUT FÜR INFORMATIK
INSTITUT FÜR INFORMATIK Schedulng jobs on unform processors revsted Klaus Jansen Chrstna Robene Bercht Nr. 1109 November 2011 ISSN 21926247 CHRISTIANALBRECHTSUNIVERSITÄT ZU KIEL Insttut für Informat
More informationUsing Multiobjective Metaheuristics to Solve the Software Project Scheduling Problem
Usng Multobectve Metaheurstcs to Solve the Software Proect Schedulng Problem Francsco Chcano Unversty of Málaga, Span chcano@lcc.uma.es Francsco Luna Unversty of Málaga, Span flv@lcc.uma.es Enrque Alba
More informationPOLYSA: A Polynomial Algorithm for Nonbinary Constraint Satisfaction Problems with and
POLYSA: A Polynomal Algorthm for Nonbnary Constrant Satsfacton Problems wth and Mguel A. Saldo, Federco Barber Dpto. Sstemas Informátcos y Computacón Unversdad Poltécnca de Valenca, Camno de Vera s/n
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationRate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Prioritybased scheduling. States of a process
Dsadvantages of cyclc TDDB47 Real Tme Systems Manual scheduler constructon Cannot deal wth any runtme changes What happens f we add a task to the set? RealTme Systems Laboratory Department of Computer
More informationThe OC Curve of Attribute Acceptance Plans
The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4
More informationExamensarbete. Rotating Workforce Scheduling. Caroline Granfeldt
Examensarbete Rotatng Workforce Schedulng Carolne Granfeldt LTH  MAT  EX   2015 / 08   SE Rotatng Workforce Schedulng Optmerngslära, Lnköpngs Unverstet Carolne Granfeldt LTH  MAT  EX   2015
More informationPeriod and Deadline Selection for Schedulability in RealTime Systems
Perod and Deadlne Selecton for Schedulablty n RealTme Systems Thdapat Chantem, Xaofeng Wang, M.D. Lemmon, and X. Sharon Hu Department of Computer Scence and Engneerng, Department of Electrcal Engneerng
More informationPSYCHOLOGICAL RESEARCH (PYC 304C) Lecture 12
14 The Chsquared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed
More information8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by
6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationAN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE
AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE YuL Huang Industral Engneerng Department New Mexco State Unversty Las Cruces, New Mexco 88003, U.S.A. Abstract Patent
More informationSupport Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.
More informationDescriptive Models. Cluster Analysis. Example. General Applications of Clustering. Examples of Clustering Applications
CMSC828G Prncples of Data Mnng Lecture #9 Today s Readng: HMS, chapter 9 Today s Lecture: Descrptve Modelng Clusterng Algorthms Descrptve Models model presents the man features of the data, a global summary
More informationInstitute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
More informationRealTime Process Scheduling
RealTme Process Schedulng ktw@cse.ntu.edu.tw (RealTme and Embedded Systems Laboratory) Independent Process Schedulng Processes share nothng but CPU Papers for dscussons: C.L. Lu and James. W. Layland,
More informationSoftware project management with GAs
Informaton Scences 177 (27) 238 241 www.elsever.com/locate/ns Software project management wth GAs Enrque Alba *, J. Francsco Chcano Unversty of Málaga, Grupo GISUM, Departamento de Lenguajes y Cencas de
More information6. EIGENVALUES AND EIGENVECTORS 3 = 3 2
EIGENVALUES AND EIGENVECTORS The Characterstc Polynomal If A s a square matrx and v s a nonzero vector such that Av v we say that v s an egenvector of A and s the correspondng egenvalue Av v Example :
More informationEnabling P2P Oneview Multiparty Video Conferencing
Enablng P2P Onevew Multparty Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract MultParty Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P
More informationLossless Data Compression
Lossless Data Compresson Lecture : Unquely Decodable and Instantaneous Codes Sam Rowes September 5, 005 Let s focus on the lossless data compresson problem for now, and not worry about nosy channel codng
More information2008/8. An integrated model for warehouse and inventory planning. Géraldine Strack and Yves Pochet
2008/8 An ntegrated model for warehouse and nventory plannng Géraldne Strack and Yves Pochet CORE Voe du Roman Pays 34 B1348 LouvanlaNeuve, Belgum. Tel (32 10) 47 43 04 Fax (32 10) 47 43 01 Emal: corestatlbrary@uclouvan.be
More informationEnergy Efficient Routing in Ad Hoc Disaster Recovery Networks
Energy Effcent Routng n Ad Hoc Dsaster Recovery Networks Gl Zussman and Adran Segall Department of Electrcal Engneerng Technon Israel Insttute of Technology Hafa 32000, Israel {glz@tx, segall@ee}.technon.ac.l
More informationAgile Traffic Merging for Data Center Networks. Qing Yi and Suresh Singh Portland State University, Oregon June 10 th, 2014
Agle Traffc Mergng for Data Center Networks Qng Y and Suresh Sngh Portland State Unversty, Oregon June 10 th, 2014 Agenda Background and motvaton Power optmzaton model Smulated greedy algorthm Traffc mergng
More informationSciences Shenyang, Shenyang, China.
Advanced Materals Research Vols. 314316 (2011) pp 13151320 (2011) Trans Tech Publcatons, Swtzerland do:10.4028/www.scentfc.net/amr.314316.1315 Solvng the TwoObectve Shop Schedulng Problem n MTO Manufacturng
More informationv a 1 b 1 i, a 2 b 2 i,..., a n b n i.
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are
More informationOn the Optimal Control of a Cascade of HydroElectric Power Stations
On the Optmal Control of a Cascade of HydroElectrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;
More informationOptimization of network mesh topologies and link capacities for congestion relief
Optmzaton of networ mesh topologes and ln capactes for congeston relef D. de Vllers * J.M. Hattngh School of Computer, Statstcal and Mathematcal Scences Potchefstroom Unversty for CHE * Emal: rwddv@pu.ac.za
More informationCS 2750 Machine Learning. Lecture 17a. Clustering. CS 2750 Machine Learning. Clustering
Lecture 7a Clusterng Mlos Hauskrecht mlos@cs.ptt.edu 539 Sennott Square Clusterng Groups together smlar nstances n the data sample Basc clusterng problem: dstrbute data nto k dfferent groups such that
More informationFault tolerance in cloud technologies presented as a service
Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance
More informationMultivariate EWMA Control Chart
Multvarate EWMA Control Chart Summary The Multvarate EWMA Control Chart procedure creates control charts for two or more numerc varables. Examnng the varables n a multvarate sense s extremely mportant
More informationParallel greedy algorithms for packing unequal circles into a strip or a rectangle. Timo Kubach, Andreas Bortfeldt und Hermann Gehring
Parallel greedy algorthms for packng unequal crcles nto a strp or a rectangle Tmo Kubach, Andreas Bortfeldt und Hermann Gehrng Dskussonsbetrag Nr. 396 Jul 2006 Dskussonsbeträge der Fakultät für Wrtschaftswssenschaft
More informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract  Stock market s one of the most complcated systems
More informationAnts Can Schedule Software Projects
Ants Can Schedule Software Proects Broderck Crawford 1,2, Rcardo Soto 1,3, Frankln Johnson 4, and Erc Monfroy 5 1 Pontfca Unversdad Católca de Valparaíso, Chle FrstName.Name@ucv.cl 2 Unversdad Fns Terrae,
More informationA New Task Scheduling Algorithm Based on Improved Genetic Algorithm
A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng Envronment Congcong Xong, Long Feng, Lxan Chen A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng
More informationn + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2)
MATH 16T Exam 1 : Part I (InClass) Solutons 1. (0 pts) A pggy bank contans 4 cons, all of whch are nckels (5 ), dmes (10 ) or quarters (5 ). The pggy bank also contans a con of each denomnaton. The total
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMISP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationChapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT
Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the
More informationOn Multicontroller Placement Optimization in Software Defined Networking  based WANs
On Multcontroller Placement Optmzaton n Software Defned Networkng  based WANs Eugen Borcoc, Radu Badea, Serban Georgca Obreja, Marus Vochn Unversty POLITEHNICA of Bucharest  UPB Bucharest, Romana eugen.borcoc@elcom.pub.ro,
More information2.4 Bivariate distributions
page 28 2.4 Bvarate dstrbutons 2.4.1 Defntons Let X and Y be dscrete r.v.s defned on the same probablty space (S, F, P). Instead of treatng them separately, t s often necessary to thnk of them actng together
More informationMethod for Production Planning and Inventory Control in Oil
Memors of the Faculty of Engneerng, Okayama Unversty, Vol.41, pp.2030, January, 2007 Method for Producton Plannng and Inventory Control n Ol Refnery TakujImamura,MasamKonshandJunIma Dvson of Electronc
More informationLecture 7 March 20, 2002
MIT 8.996: Topc n TCS: Internet Research Problems Sprng 2002 Lecture 7 March 20, 2002 Lecturer: Bran Dean Global Load Balancng Scrbe: John Kogel, Ben Leong In today s lecture, we dscuss global load balancng
More informationOnline Learning from Experts: Minimax Regret
E0 370 tatstcal Learnng Theory Lecture 2 Nov 24, 20) Onlne Learnng from Experts: Mn Regret Lecturer: hvan garwal crbe: Nkhl Vdhan Introducton In the last three lectures we have been dscussng the onlne
More informationLogistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification
Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson
More informationSPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background:
SPEE Recommended Evaluaton Practce #6 efnton of eclne Curve Parameters Background: The producton hstores of ol and gas wells can be analyzed to estmate reserves and future ol and gas producton rates and
More informationRobust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School
Robust Desgn of Publc Storage Warehouses Yemng (Yale) Gong EMLYON Busness School Rene de Koster Rotterdam school of management, Erasmus Unversty Abstract We apply robust optmzaton and revenue management
More informationA GENERAL APPROACH FOR SECURITY MONITORING AND PREVENTIVE CONTROL OF NETWORKS WITH LARGE WIND POWER PRODUCTION
A GENERAL APPROACH FOR SECURITY MONITORING AND PREVENTIVE CONTROL OF NETWORKS WITH LARGE WIND POWER PRODUCTION Helena Vasconcelos INESC Porto hvasconcelos@nescportopt J N Fdalgo INESC Porto and FEUP jfdalgo@nescportopt
More informationQuestions that we may have about the variables
Antono Olmos, 01 Multple Regresson Problem: we want to determne the effect of Desre for control, Famly support, Number of frends, and Score on the BDI test on Perceved Support of Latno women. Dependent
More informationOptimal Joint Replenishment, Delivery and Inventory Management Policies for Perishable Products
Optmal Jont Replenshment, Delvery and Inventory Management Polces for Pershable Products Leandro C. Coelho Glbert Laporte May 2013 CIRRELT201332 Bureaux de Montréal : Bureaux de Québec : Unversté de
More informationMining Multiple Large Data Sources
The Internatonal Arab Journal of Informaton Technology, Vol. 7, No. 3, July 2 24 Mnng Multple Large Data Sources Anmesh Adhkar, Pralhad Ramachandrarao 2, Bhanu Prasad 3, and Jhml Adhkar 4 Department of
More informationCalculation of Sampling Weights
Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a twostage stratfed cluster desgn. 1 The frst stage conssted of a sample
More informationResearch Article Enhanced TwoStep Method via Relaxed Order of αsatisfactory Degrees for Fuzzy Multiobjective Optimization
Hndaw Publshng Corporaton Mathematcal Problems n Engneerng Artcle ID 867836 pages http://dxdoorg/055/204/867836 Research Artcle Enhanced TwoStep Method va Relaxed Order of αsatsfactory Degrees for Fuzzy
More informationAbteilung für Stadt und Regionalentwicklung Department of Urban and Regional Development
Abtelung für Stadt und Regonalentwcklung Department of Urban and Regonal Development Gunther Maer, Alexander Kaufmann The Development of Computer Networks Frst Results from a Mcroeconomc Model SREDscusson
More informationActivity Scheduling for CostTime Investment Optimization in Project Management
PROJECT MANAGEMENT 4 th Internatonal Conference on Industral Engneerng and Industral Management XIV Congreso de Ingenería de Organzacón Donosta San Sebastán, September 8 th 10 th 010 Actvty Schedulng
More informationApplication of MultiAgents for Fault Detection and Reconfiguration of Power Distribution Systems
1 Applcaton of MultAgents for Fault Detecton and Reconfguraton of Power Dstrbuton Systems K. Nareshkumar, Member, IEEE, M. A. Choudhry, Senor Member, IEEE, J. La, A. Felach, Senor Member, IEEE AbstractThe
More informationLinear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits
Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.
More informationDISPATCHING VEHICLES CONSIDERING UNCERTAIN HANDLING TIMES AT PORT CONTAINER TERMINALS
DISPATCHING VEHICLES CONSIDERING UNCERTAIN HANDLING TIMES AT PORT CONTAINER TERMINALS Vu Duc Nguyen Department of Industral Engneerng, Pusan Natonal Unversty, Busan 609735, South Korea duc.se@pusan.ac.r
More informationNetwork Aware LoadBalancing via Parallel VM Migration for Data Centers
Network Aware LoadBalancng va Parallel VM Mgraton for Data Centers KunTng Chen 2, Chen Chen 12, PoHsang Wang 2 1 Informaton Technology Servce Center, 2 Department of Computer Scence Natonal Chao Tung
More informationA multistart local search heuristic for ship scheduling a computational study
Computers & Operatons Research 34 (2007) 900 917 www.elsever.com/locate/cor A multstart local search heurstc for shp schedulng a computatonal study Ger BrZnmo a,b,, Marelle Chrstansen b, Kjetl Fagerholt
More informationInventory Rebalancing and Vehicle Routing in Bike Sharing Systems
Inventory Rebalancng and Vehcle Routng n Bke Sharng Systems Jasper Schujbroek School of Industral Engneerng, Endhoven Unversty of Technology, The Netherlands, j.m.a.schujbroek@student.tue.nl Robert Hampshre*
More informationPowerofTwo Policies for Single Warehouse MultiRetailer Inventory Systems with Order Frequency Discounts
Powerofwo Polces for Sngle Warehouse MultRetaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
More informationA Constant Factor Approximation for the Single Sink Edge Installation Problem
A Constant Factor Approxmaton for the Sngle Snk Edge Installaton Problem Sudpto Guha Adam Meyerson Kamesh Munagala Abstract We present the frst constant approxmaton to the sngle snk buyatbulk network
More information( ) Homework Solutions Physics 8B Spring 09 Chpt. 32 5,18,25,27,36,42,51,57,61,76
Homework Solutons Physcs 8B Sprng 09 Chpt. 32 5,8,25,27,3,42,5,57,,7 32.5. Model: Assume deal connectng wres and an deal battery for whch V bat = E. Please refer to Fgure EX32.5. We wll choose a clockwse
More informationThe Retail Planning Problem Under Demand Uncertainty
Vol., No. 5, September October 013, pp. 100 113 ISSN 10591478 EISSN 19375956 13 05 100 DOI 10.1111/j.19375956.01.0144.x 013 Producton and Operatons Management Socety The Retal Plannng Problem Under
More informationDynamic Resource Allocation and Power Management in Virtualized Data Centers
Dynamc Resource Allocaton and Power Management n Vrtualzed Data Centers Rahul Urgaonkar, Ulas C. Kozat, Ken Igarash, Mchael J. Neely urgaonka@usc.edu, {kozat, garash}@docomolabsusa.com, mjneely@usc.edu
More informationScheduling and Resource Allocation in OFDMA Wireless Systems
Schedulng and Resource Allocaton n OFDMA Wreless Systems Janwe Huang, Vjay Subramanan, Randall Berry, and Rajeev Agrawal February 2009 Book chapter n Orthogonal Frequency Dvson Multple Access Fundamentals
More information