|
David Shmoys
David Bernard Shmoys (born 1959) is a Professor in the School of Operations Research and Information Engineering and the Department of Computer Science at Cornell University. He obtained his Ph.D. from the University of California, Berkeley in 1984. His major focus has been in the design and analysis of algorithms for discrete optimization problems. In particular, his work has highlighted the role of linear programming in the design of approximation algorithms for NP-hard problems. He is known for his pioneering research on providing first constant factor performance guarantee for several scheduling and clustering problems including the k-center and k-median problems and the generalized assignment problem. Polynomial-time approximation schemes that he developed for scheduling problems have found applications in many subsequent works. His current research includes stochastic optimization for data-driven models in a broad cross-section of areas, including COVID epidemiological m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Science
Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to Applied science, practical disciplines (including the design and implementation of Computer architecture, hardware and Computer programming, software). Computer science is generally considered an area of research, academic research and distinct from computer programming. Algorithms and data structures are central to computer science. The theory of computation concerns abstract models of computation and general classes of computational problem, problems that can be solved using them. The fields of cryptography and computer security involve studying the means for secure communication and for preventing Vulnerability (computing), security vulnerabilities. Computer graphics (computer science), Computer graphics and computational geometry address the generation of images. Progr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Scheduling (computing)
In computing, scheduling is the action of assigning ''resources'' to perform ''tasks''. The ''resources'' may be processors, network links or expansion cards. The ''tasks'' may be threads, processes or data flows. The scheduling activity is carried out by a process called scheduler. Schedulers are often designed so as to keep all computer resources busy (as in load balancing), allow multiple users to share system resources effectively, or to achieve a target quality-of-service. Scheduling is fundamental to computation itself, and an intrinsic part of the execution model of a computer system; the concept of scheduling makes it possible to have computer multitasking with a single central processing unit (CPU). Goals A scheduler may aim at one or more goals, for example: * maximizing ''throughput'' (the total amount of work completed per time unit); * minimizing '' wait time'' (time from work becoming ready until the first point it begins execution); * minimizing '' latency ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Facility Location , with the goal of sharing costs among clients
{{SIA ...
Facility location is a name given to several different problems in computer science and in game theory: * Facility location problem, the optimal placement of facilities as a function of transportation costs and other factors * Facility location (competitive game), in which competitors simultaneously select facility locations and prices, in order to maximize profit * Facility location (cooperative game) The cooperative facility location game is a cooperative game of cost sharing. The goal is to share the cost of opening new facilities between the clients enjoying these facilities.Kamal Jain and Mohammad Mahdian, "Cost Sharing". Chapter 15 in The g ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
K Medians
K, or k, is the eleventh letter in the Latin alphabet, used in the modern English alphabet, the alphabets of other western European languages and others worldwide. Its name in English is ''kay'' (pronounced ), plural ''kays''. The letter K usually represents the voiceless velar plosive. History The letter K comes from the Greek letter Κ (kappa), which was taken from the Semitic kaph, the symbol for an open hand. This, in turn, was likely adapted by Semitic tribes who had lived in Egypt from the hieroglyph for "hand" representing /ḏ/ in the Egyptian word for hand, ⟨ ḏ-r-t⟩ (likely pronounced in Old Egyptian). The Semites evidently assigned it the sound value instead, because their word for hand started with that sound. K was brought into the Latin alphabet with the name ''ka'' /kaː/ to differentiate it from C, named ''ce'' (pronounced /keː/) and Q, named ''qu'' and pronounced /kuː/. In the earliest Latin inscriptions, the letters C, K and Q were all used t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Moses Charikar
Moses Samson Charikar is an Indian computer scientist who works as a professor at Stanford University. He was previously a professor at Princeton University. The topics of his research include approximation algorithms, streaming algorithms, and metric embeddings. He is known for the creation of the SimHash algorithm used by Google for near duplicate detection. Charikar was born in Bombay, India, and competed for India at the 1990 and 1991 International Mathematical Olympiads, winning bronze and silver medals respectively. He did his undergraduate studies at the Indian Institute of Technology Bombay. In 2000 he completed a doctorate from Stanford University, under the supervision of Rajeev Motwani; he joined the Princeton faculty in 2001. In 2012 he was awarded the Paris Kanellakis Award along with Andrei Broder and Piotr Indyk for their research on locality-sensitive hashing In computer science, locality-sensitive hashing (LSH) is an algorithmic technique that hashes similar in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Extreme Point Solution
Extreme may refer to: Science and mathematics Mathematics *Extreme point, a point in a convex set which does not lie in any open line segment joining two points in the set *Maxima and minima, extremes on a mathematical function Science *Extremophile, an organism which thrives in or requires "extreme" *Extremes on Earth *List of extrasolar planet extremes Politics *Extremism, political ideologies or actions deemed outside the acceptable range *The Extreme (Italy) or Historical Far Left, a left-wing parliamentary group in Italy 1867–1904 Business *Extreme Networks, a California-based networking hardware company *Extreme Records, an Australia-based record label *Extreme Associates, a California-based adult film studio Computer science *Xtreme Mod, a peer-to-peer file sharing client for Windows Sports and entertainment Sport *Extreme sport *Extreme Sports Channel A global sports and lifestyle brand dedicated to extreme sports and youth culture *Los Angeles Xtreme, a defunct ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Parametric Pruning
Parametric may refer to: Mathematics *Parametric equation, a representation of a curve through equations, as functions of a variable *Parametric statistics, a branch of statistics that assumes data has come from a type of probability distribution *Parametric derivative, a type of derivative in calculus *Parametric model, a family of distributions that can be described using a finite number of parameters *Parametric oscillator, a harmonic oscillator whose parameters oscillate in time *Parametric surface, a particular type of surface in the Euclidean space R3 *Parametric family, a family of objects whose definitions depend on a set of parameters Science * Parametric process, in optical physics, any process in which an interaction between light and matter does not change the state of the material *Spontaneous parametric down-conversion, in quantum optics, a source of entangled photon pairs and of single photons *Optical parametric amplifier, a type of laser light source that emi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jan Karel Lenstra
Jan Karel Lenstra (born 19 December 1947, in Zaandam) is a Dutch mathematician and operations researcher, known for his work on scheduling algorithms, local search, and the travelling salesman problem. Lenstra received his Ph.D. from the University of Amsterdam in 1976, advised by Gijsbert de Leve. He then became a researcher at the Centrum Wiskunde & Informatica, where he remained until 1989. After taking positions at the Eindhoven University of Technology (where he became Dean of the Faculty of Mathematics and Computer Science) and the Georgia Institute of Technology, he returned to CWI as its director in 2003. He stepped down in 2011, and at that time became a CWI Fellow.. He was editor-in-chief of '' Mathematics of Operations Research'' from 1993 to 1998, and is editor-in-chief of ''Operations Research Letters'' since 2002.Faculty profile CWI, r ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Facility Location Problem
The study of facility location problems (FLP), also known as location analysis, is a branch of operations research and computational geometry concerned with the optimal placement of facilities to minimize transportation costs while considering factors like avoiding placing hazardous materials near housing, and competitors' facilities. The techniques also apply to cluster analysis. Minimum facility location A simple facility location problem is the Weber problem, in which a single facility is to be placed, with the only optimization criterion being the minimization of the weighted sum of distances from a given set of point sites. More complex problems considered in this discipline include the placement of multiple facilities, constraints on the locations of facilities, and more complex optimization criteria. In a basic formulation, the facility location problem consists of a set of potential facility sites ''L'' where a facility can be opened, and a set of demand points ''D'' that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
K-Medians
In statistics, ''k''-medians clusteringP. S. Bradley, O. L. Mangasarian, and W. N. Street, "Clustering via Concave Minimization," in Advances in Neural Information Processing Systems, vol. 9, M. C. Mozer, M. I. Jordan, and T. Petsche, Eds. Cambridge, Massachusetts: MIT Press, 1997, pp. 368–374. is a cluster analysis algorithm. It is a variation of ''k''-means clustering where instead of calculating the mean for each cluster to determine its centroid, one instead calculates the median. This has the effect of minimizing error over all clusters with respect to the 1-norm distance metric, as opposed to the squared 2-norm distance metric (which ''k''-means does.) This relates directly to the ''k''-median problem with respect to the 1-norm, which is the problem of finding ''k'' centers such that the clusters formed by them are the most compact. Formally, given a set of data points ''x'', the ''k'' centers ''c''''i'' are to be chosen so as to minimize the sum of the distances from ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Unrelated Parallel Machine Scheduling
''Unrelated'' is a 2007 British drama film written and directed by Joanna Hogg, starring Kathryn Worth, Tom Hiddleston, Mary Roscoe, David Rintoul and Henry Lloyd-Hughes. It was released in the US on 20 February 2008. Plot summary Anna (Kathryn Worth) arrives in Tuscany to stay with her old school friend Verena (Mary Roscoe) and her family in their rented villa in San Fabiano. She was meant to be accompanied by her boyfriend, Alex, but tells Verena that he had to stay in London at the last minute to work. During the film it becomes apparent that Anna took the holiday to get some time away from him following a fight. The group is split effectively between the adults: Verena, her new husband Charlie (Michael Hadley), and Verena's cousin George (David Rintoul); and the teenagers: Verena's children, Jack (Henry Lloyd-Hughes) and Badge (Emma Hiddleston), Charlie's son, Archie (Harry Kershaw), and George's son, Oakley (Tom Hiddleston). Trying to escape her relationship worries, Anna sp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
