|
Teofilo F. Gonzalez
Teofilo Francisco Gonzalez Arce (born January 26, 1948, in Monterrey, Mexico) is a Mexican-American computer scientist who is professor emeritus of computer science at the University of California, Santa Barbara. In 1972, Gonzalez was one of the first students who earned a bachelor's degree in computer science (Ingeniero en Sistemas Computacionales) in Mexico, at the Monterrey Institute of Technology and Higher Education. He completed his Ph.D. in 1975 from the University of Minnesota under the supervision of Sartaj Sahni. He taught at the University of Oklahoma from 1975 to 1976, at the Pennsylvania State University from 1976 to 1979, at the Monterrey Institute of Technology and Higher Education from 1979 to 1980, and at the University of Texas at Dallas from 1980 to 1984, before joining the UCSB computer science faculty in 1984. He spent Sabbatical Leaves at Utrecht University (1990) in the Netherlands and the Monterrey Institute of Technology and Higher Education. Professor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Monterrey, Mexico
Monterrey (, , abbreviated as MtY) is the capital and largest city of the northeastern Mexican state of Nuevo León. It is the ninth-largest city and the second largest metropolitan area, after Greater Mexico City. Located at the foothills of the Sierra Madre Oriental, Monterrey is a major business and industrial hub in North America. The city anchors the Monterrey metropolitan area, the second-largest in Mexico with an estimated population of 5,341,171 people as of 2020 and it is also the second-most productive metropolitan area in Mexico with a GDP (purchasing power parity, PPP) of US$140 billion in 2015. According to the 2020 census, Monterrey itself has a population of 1,142,194. Monterrey is considered one of the most livable cities in Mexico, and a 2018 study ranked the suburb of San Pedro Garza García as the city with the best quality of life in the country. It serves as a commercial center of northern Mexico and is the base of many significant international corporations ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hardness Of Approximation
In computer science, hardness of approximation is a field that studies the algorithmic complexity of finding near-optimal solutions to optimization problems. Scope Hardness of approximation complements the study of approximation algorithms by proving, for certain problems, a limit on the factors with which their solution can be efficiently approximated. Typically such limits show a factor of approximation beyond which a problem becomes NP-hard, implying that finding a polynomial time approximation for the problem is impossible unless NP=P. Some hardness of approximation results, however, are based on other hypotheses, a notable one among which is the unique games conjecture. History Since the early 1970s it was known that many optimization problems could not be solved in polynomial time unless P = NP, but in many of these problems the optimal solution could be efficiently approximated to a certain degree. In the 1970s, Teofilo F. Gonzalez and Sartaj Sahni began the study of hard ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
University Of Minnesota College Of Science And Engineering Alumni
A university () is an institution of tertiary education and research which awards academic degrees in several academic disciplines. ''University'' is derived from the Latin phrase , which roughly means "community of teachers and scholars". Universities typically offer both undergraduate and postgraduate programs. The first universities in Europe were established by Catholic monks. The University of Bologna (), Italy, which was founded in 1088, is the first university in the sense of: *being a high degree-awarding institute. *using the word (which was coined at its foundation). *having independence from the ecclesiastic schools and issuing secular as well as non-secular degrees (with teaching conducted by both clergy and non-clergy): grammar, rhetoric, logic, theology, canon law and notarial law.Hunt Janin: "The university in medieval life, 1179–1499", McFarland, 2008, , p. 55f.de Ridder-Symoens, Hilde''A History of the University in Europe: Volume 1, Universities in the Mid ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Monterrey Institute Of Technology And Higher Education Alumni
Monterrey (, , abbreviated as MtY) is the capital and largest city of the northeastern Mexican state of Nuevo León. It is the ninth-largest city and the second largest metropolitan area, after Greater Mexico City. Located at the foothills of the Sierra Madre Oriental, Monterrey is a major business and industrial hub in North America. The city anchors the Monterrey metropolitan area, the second-largest in Mexico with an estimated population of 5,341,171 people as of 2020 and it is also the second-most productive metropolitan area in Mexico with a GDP ( PPP) of US$140 billion in 2015. According to the 2020 census, Monterrey itself has a population of 1,142,194. Monterrey is considered one of the most livable cities in Mexico, and a 2018 study ranked the suburb of San Pedro Garza García as the city with the best quality of life in the country. It serves as a commercial center of northern Mexico and is the base of many significant international corporations. Its purchasing power p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Living People
Purpose: Because living persons may suffer personal harm from inappropriate information, we should watch their articles carefully. By adding an article to this category, it marks them with a notice about sources whenever someone tries to edit them, to remind them of WP:BLP (biographies of living persons) policy that these articles must maintain a neutral point of view, maintain factual accuracy, and be properly sourced. Recent changes to these articles are listed on Special:RecentChangesLinked/Living people. Organization: This category should not be sub-categorized. Entries are generally sorted by family name In many societies, a surname, family name, or last name is the mostly hereditary portion of one's personal name that indicates one's family. It is typically combined with a given name to form the full name of a person, although several give .... Maintenance: Individuals of advanced age (over 90), for whom there has been no new documentation in the last ten ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1948 Births
Events January * January 1 ** The General Agreement on Tariffs and Trade (GATT) is inaugurated. ** The current Constitutions of Constitution of Italy, Italy and of Constitution of New Jersey, New Jersey (both later subject to amendment) go into effect. ** The railways of Britain are nationalized, to form British Railways. * January 4 – British rule in Burma, Burma gains its independence from the United Kingdom, becoming an independent republic, named the 'Post-independence Burma (1948–1962), Union of Burma', with Sao Shwe Thaik as its first President and U Nu its first Prime Minister. * January 5 – In the United States: ** Warner Brothers shows the first color newsreel (''Tournament of Roses Parade'' and the ''Rose Bowl Game''). ** The first Kinsey Reports, Kinsey Report, ''Sexual Behavior in the Human Male'', is published. * January 7 – Mantell UFO incident: Kentucky Air National Guard pilot Thomas Mantell crashes while in pursuit of an unidentified fl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Theoretical Computer Science (journal)
''Theoretical Computer Science'' (''TCS'') is a computer science journal published by Elsevier, started in 1975 and covering theoretical computer science. The journal publishes 52 issues a year. It is abstracted and indexed by Scopus and the Science Citation Index. According to the Journal Citation Reports, its 2020 impact factor The impact factor (IF) or journal impact factor (JIF) of an academic journal is a type of journal ranking. Journals with higher impact factor values are considered more prestigious or important within their field. The Impact Factor of a journa ... is 0.827. References Computer science journals Elsevier academic journals Academic journals established in 1975 {{comp-sci-theory-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Operations Research (journal)
''Operations Research'' is a bimonthly peer-reviewed academic journal covering operations research that is published by the Institute for Operations Research and the Management Sciences. It was established in 1952 as the ''Journal of the Operations Research Society of America'' and obtained its current name in 1955. The editor-in-chief is Amy Ward (University of Chicago). Abstracting and indexing The journal is abstracted and indexed by ''Mathematical Reviews'', MathSciNet, Science Citation Index Expanded, Scopus, Social Sciences Citation Index, and ''Zentralblatt MATH''. According to the ''Journal Citation Reports'', the journal has a 2018 impact factor The impact factor (IF) or journal impact factor (JIF) of an academic journal is a type of journal ranking. Journals with higher impact factor values are considered more prestigious or important within their field. The Impact Factor of a journa ... of 2.604. References External links * Operations research journals Academ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Journal Of The ACM
The ''Journal of the ACM'' (''JACM'') is a peer-reviewed scientific journal covering computer science in general, especially theoretical aspects. It is an official journal of the Association for Computing Machinery. Its current editor-in-chief is Venkatesan Guruswami. The journal was established in 1954 and "computer scientists universally hold the ''Journal of the ACM'' in high esteem". See also * ''Communications of the ACM ''Communications of the ACM'' (''CACM'') is the monthly journal of the Association for Computing Machinery (ACM). History It was established in 1958, with Saul Rosen as its first managing editor. It is sent to all ACM members. Articles are i ...'' References External links * {{DEFAULTSORT:Journal Of The Acm Academic journals established in 1954 Computer science journals Association for Computing Machinery academic journals Bimonthly journals English-language journals ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Job Shop Scheduling
Job-shop scheduling, the job-shop problem (JSP) or job-shop scheduling problem (JSSP) is an optimization problem in computer science and operations research. It is a variant of optimal job scheduling. In a general job scheduling problem, we are given ''n'' jobs ''J''1, ''J''2, ..., ''Jn'' of varying processing times, which need to be scheduled on ''m'' machines with varying processing power, while trying to minimize the makespan – the total length of the schedule (that is, when all the jobs have finished processing). In the specific variant known as ''job-shop scheduling'', each job consists of a set of ''operations'' ''O''1, ''O''2, ..., ''On'' which need to be processed in a specific order (known as ''precedence constraints''). Each operation has a ''specific machine'' that it needs to be processed on and only one operation in a job can be processed at a given time. A common relaxation is the flexible job shop, where each operation can be processed ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Flow Shop Scheduling
Flow-shop scheduling is an optimization problem in computer science and operations research. It is a variant of optimal job scheduling. In a general job-scheduling problem, we are given ''n'' jobs ''J''1, ''J''2, ..., ''Jn'' of varying processing times, which need to be scheduled on ''m'' machines with varying processing power, while trying to minimize the makespan – the total length of the schedule (that is, when all the jobs have finished processing). In the specific variant known as ''flow-shop scheduling'', each job contains exactly ''m'' operations. The ''i''-th operation of the job must be executed on the ''i''-th machine. No machine can perform more than one operation simultaneously. For each operation of each job, execution time is specified. Flow-shop scheduling is a special case of job-shop scheduling where there is strict order of all operations to be performed on all jobs. Flow-shop scheduling may apply as well to production facilities as to computin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Open-shop Scheduling
Open-shop scheduling or open-shop scheduling problem (OSSP) is an optimization problem in computer science and operations research. It is a variant of optimal job scheduling. In a general job-scheduling problem, we are given ''n'' jobs ''J''1, ''J''2, ..., ''Jn'' of varying processing times, which need to be scheduled on ''m'' machines with varying processing power, while trying to minimize the makespan - the total length of the schedule (that is, when all the jobs have finished processing). In the specific variant known as ''open-shop scheduling'', each job consists of a set of ''operations'' ''O''1, ''O''2, ..., ''On'' which need to be processed in an ''arbitrary'' order. The problem was first studied by Teofilo F. Gonzalez and Sartaj Sahni in 1976. In the standard three-field notation for optimal job-scheduling problems, the open-shop variant is denoted by O in the first field. For example, the problem denoted by "O3, p_, C_\max" is a 3-machines jo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
