|
Tami Tamir
Tamar (Tami) Tamir (born 1968) is an Israeli computer scientist specializing in approximation algorithms and algorithmic mechanism design, especially for problems in resource allocation, scheduling, and packing problems. She is a professor in the Efi Arazi School of Computer Science of Reichman University. Education and career Tamir was born in 1968, and graduated in 1992 from the Technion – Israel Institute of Technology with a bachelor's degree in computer science. She continued at the Technion for graduate study, earning a master's degree in 1995 and completing her Ph.D. in 2001. Her doctoral dissertation, ''Class-Constrained Resource Allocation Problems'', was supervised by Hadas Shachnai. While still a graduate student, Tamir worked at Intel, in the Israel Software Lab, from 1994 to 1997, and had a summer position at Hewlett-Packard The Hewlett-Packard Company, commonly shortened to Hewlett-Packard ( ) or HP, was an American multinational information technol ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Reichman University
Reichman University ( he, אוניברסיטת רייכמן) is Israel's only private university, located in Herzliya, Tel Aviv District. It was founded in 1994 as the IDC Herzliya private college, before being rebranded in 2021. It receives no direct government funding, and in August 2021 became Israel's first private university. History Reichmann University was founded in 1994 by Uriel Reichman as the Israeli private college Interdisciplinary Center Herzliya (IDC Herzliya, he, המרכז הבינתחומי הרצליה). The campus is located in the city of Herzliya, Herzliya, Israel, six miles north of the city Tel Aviv, on the grounds of a former Israeli Air Force base. It served the first squadron of the air force for three critical months in the 1948 Arab–Israeli War, War of Independence. In 2009, Alpha Epsilon Pi opened the first college fraternity in Israel at the IDC. In 2012, the college attracted controversy for the School of Sustainability being funded by Israe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Technion – Israel Institute Of Technology
The Technion – Israel Institute of Technology ( he, הטכניון – מכון טכנולוגי לישראל) is a public research university located in Haifa, Israel. Established in 1912 under the dominion of the Ottoman Empire, the Technion is the oldest university in the country. The Technion is ranked as one of the top universities in both Israel and the Middle East, and in the world's top 100 universities in the 2022 Academic Ranking of World Universities. The university offers degrees in science and engineering, and related fields such as architecture, medicine, industrial management, and education. It has 19 academic departments, 60 research centers, and 12 affiliated teaching hospitals. Since its founding, it has awarded more than 123,000 degrees and its graduates are cited for providing the skills and education behind the creation and protection of the State of Israel. Technion's 565 faculty members include three Nobel Laureates in chemistry. Four Nobel Laureates ha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Approximation Algorithm
In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems (in particular NP-hard problems) with provable guarantees on the distance of the returned solution to the optimal one. Approximation algorithms naturally arise in the field of theoretical computer science as a consequence of the widely believed P ≠ NP conjecture. Under this conjecture, a wide class of optimization problems cannot be solved exactly in polynomial time. The field of approximation algorithms, therefore, tries to understand how closely it is possible to approximate optimal solutions to such problems in polynomial time. In an overwhelming majority of the cases, the guarantee of such algorithms is a multiplicative one expressed as an approximation ratio or approximation factor i.e., the optimal solution is always guaranteed to be within a (predetermined) multiplicative factor of the returned solution. However, there are ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algorithmic Mechanism Design
Algorithmic mechanism design (AMD) lies at the intersection of economic game theory, optimization, and computer science. The prototypical problem in mechanism design is to design a system for multiple self-interested participants, such that the participants' self-interested actions at equilibrium lead to good system performance. Typical objectives studied include revenue maximization and social welfare maximization. Algorithmic mechanism design differs from classical economic mechanism design in several respects. It typically employs the analytic tools of theoretical computer science, such as worst case analysis and approximation ratios, in contrast to classical mechanism design in economics which often makes distributional assumptions about the agents. It also considers computational constraints to be of central importance: mechanisms that cannot be efficiently implemented in polynomial time are not considered to be viable solutions to a mechanism design problem. This often, for exam ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Resource Allocation
In economics, resource allocation is the assignment of available resources to various uses. In the context of an entire economy, resources can be allocated by various means, such as markets, or planning. In project management, resource allocation or resource management is the scheduling of activities and the resources required by those activities while taking into consideration both the resource availability and the project time. Economics In economics, the field of public finance deals with three broad areas: macroeconomic stabilization, the distribution of income and wealth, and the allocation of resources. Much of the study of the allocation of resources is devoted to finding the conditions under which particular mechanisms of resource allocation lead to Pareto efficient outcomes, in which no party's situation can be improved without hurting that of another party. Strategic planning In strategic planning, resource allocation is a plan for using available resources, for exampl ... [...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] |
Packing Problems
Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to either pack a single container as densely as possible or pack all objects using as few containers as possible. Many of these problems can be related to real-life packaging, storage and transportation issues. Each packing problem has a dual covering problem, which asks how many of the same objects are required to completely cover every region of the container, where objects are allowed to overlap. In a bin packing problem, you are given: * A ''container'', usually a two- or three-dimensional convex region, possibly of infinite size. Multiple containers may be given depending on the problem. * A set of ''objects'', some or all of which must be packed into one or more containers. The set may contain different objects with their sizes specified, or a single object of a fixed dimension that can be used repeatedly. Usually the packing ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hadas Shachnai
Hadas Shachnai ( he, הדס שכנאי) is an Israeli computer scientist specializing in combinatorial optimization, including knapsack problems, interval scheduling, and the optimization of submodular set function In mathematics, a submodular set function (also known as a submodular function) is a set function whose value, informally, has the property that the difference in the incremental value of the function that a single element makes when added to an ...s. She is a professor of computer science at the Technion – Israel Institute of Technology, and co-editor-in-chief of '' Discrete Mathematics & Theoretical Computer Science''. Education Shachnai completed her Ph.D. in 1991 at the Technion. Her doctoral dissertation, ''Keeping Linear Self Organizing Lists Under Counter Schemes'', was supervised by Alon Itai. Selected publications * * * * * References {{DEFAULTSORT:Shachnai, Hadas Year of birth missing (living people) Living people Israeli computer scientists ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hewlett-Packard
The Hewlett-Packard Company, commonly shortened to Hewlett-Packard ( ) or HP, was an American multinational information technology company headquartered in Palo Alto, California. HP developed and provided a wide variety of hardware components, as well as software and related services to consumers, small and medium-sized businesses ( SMBs), and large enterprises, including customers in the government, health, and education sectors. The company was founded in a one-car garage in Palo Alto by Bill Hewlett and David Packard in 1939, and initially produced a line of electronic test and measurement equipment. The HP Garage at 367 Addison Avenue is now designated an official California Historical Landmark, and is marked with a plaque calling it the "Birthplace of 'Silicon Valley'". The company won its first big contract in 1938 to provide test and measurement instruments for Walt Disney's production of the animated film ''Fantasia'', which allowed Hewlett and Packard to formally esta ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
University Of Washington
The University of Washington (UW, simply Washington, or informally U-Dub) is a public research university in Seattle, Washington. Founded in 1861, Washington is one of the oldest universities on the West Coast; it was established in Seattle approximately a decade after the city's founding. The university has a 703 acre main campus located in the city's University District, as well as campuses in Tacoma and Bothell. Overall, UW encompasses over 500 buildings and over 20 million gross square footage of space, including one of the largest library systems in the world with more than 26 university libraries, art centers, museums, laboratories, lecture halls, and stadiums. The university offers degrees through 140 departments, and functions on a quarter system. Washington is the flagship institution of the six public universities in Washington state. It is known for its medical, engineering, and scientific research. Washington is a member of the Association of American Universiti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Information And Computation
''Information and Computation'' is a closed-access computer science journal published by Elsevier (formerly Academic Press). The journal was founded in 1957 under its former name ''Information and Control'' and given its current title in 1987. , the current editor-in-chief is David Peleg. The journal publishes 12 issues a year. History ''Information and Computation'' was founded as ''Information and Control'' in 1957 at the initiative of Leon Brillouin and under the editorship of Leon Brillouin, Colin Cherry and Peter Elias. Murray Eden joined as editor in 1962 and became sole editor-in-chief in 1967. He was succeeded by Albert R. Meyer in 1981, under whose editorship the journal was rebranded ''Information and Computation'' in 1987 in response to the shifted focus of the journal towards theory of computation and away from control theory. In 2020, Albert Mayer was succeeded by David Peleg as editor-in-chief of the journal. Indexing All articles from the ''Information and Comput ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Living People
Related categories * :Year of birth missing (living people) / :Year of birth unknown * :Date of birth missing (living people) / :Date of birth unknown * :Place of birth missing (living people) / :Place of birth unknown * :Year of death missing / :Year of death unknown * :Date of death missing / :Date of death unknown * :Place of death missing / :Place of death unknown * :Missing middle or first names See also * :Dead people * :Template:L, which generates this category or death years, and birth year and sort keys. : {{DEFAULTSORT:Living people 21st-century people People by status ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
