scispace - formally typeset
Search or ask a question
Institution

Carnegie Mellon University

EducationPittsburgh, Pennsylvania, United States
About: Carnegie Mellon University is a education organization based out in Pittsburgh, Pennsylvania, United States. It is known for research contribution in the topics: Computer science & Robot. The organization has 36317 authors who have published 104359 publications receiving 5975734 citations. The organization is also known as: CMU & Carnegie Mellon.


Papers
More filters
Journal ArticleDOI
TL;DR: The simple assembly line balancing problem (SALBP) as discussed by the authors is a deterministic optimization problem where all input parameters are assumed to be known with certainty and all the algorithms discussed are exact.
Abstract: In this survey paper we discuss the development of the simple assembly line balancing problem SALBP; modifications and generalizations over time; present alternate 0-1 programming formulations and a general integer programming formulation of the problem; discuss other well-known problems related to SALBP; describe and comment on a number of exact i.e., optimum-seeking methods; and present a summary of the reported computational experiences. All models discussed here are deterministic i.e., all input parameters are assumed to be known with certainty and all the algorithms discussed are exact. The problem is termed "simple" in the sense that no "mixed-models," "subassembly lines," "zoning restrictions," etc. are considered. Due to the richness of the literature, we exclude from discussion here a the inexact i.e., heuristic/approximate algorithms for SALPB and b the algorithms for the general assembly line balancing problem including the stochastic models.

834 citations

Journal ArticleDOI
01 Feb 1982-Cell
TL;DR: The fact that the adenovirus and Sv40 tumor antigens, both required for transformation, can be found in physical association with the same cellular protein in a transformed cell is a good indication that these two diverse viral proteins share some common mechanisms or functions.

834 citations

Book ChapterDOI
27 Jun 1993
TL;DR: It is suggested that it may be easier to learn several hard tasks at one time than to learn these same tasks separately, because the information provided by the training signal for each task serves as a domain-specific inductive bias for the other tasks.
Abstract: This paper suggests that it may be easier to learn several hard tasks at one time than to learn these same tasks separately. In effect, the information provided by the training signal for each task serves as a domain-specific inductive bias for the other tasks. Frequently the world gives us clusters of related tasks to learn. When it does not, it is often straightforward to create additional tasks. For many domains, acquiring inductive bias by collecting additional teaching signal may be more practical than the traditional approach of codifying domain-specific biases acquired from human expertise. We call this approach Multitask Learning (MTL). Since much of the power of an inductive learner follows directly from its inductive bias, multitask learning may yield more powerful learning. An empirical example of multitask connectionist learning is presented where learning improves by training one network on several related tasks at the same time. Multitask decision tree induction is also outlined.

833 citations

Journal ArticleDOI
TL;DR: Atomically precise Aun(SR)m nanoclusters are expected to become a promising class of model catalysts that will provide new opportunities for achieving fundamental understanding of metal nanocatalysis, such as insight into size dependence and deep understanding of molecular activation, active centers, and catalytic mechanisms through correlation of behavior with the structures of nanocluster structures.
Abstract: Many industrial catalysts involve nanoscale metal particles (typically 1–100 nm), and understanding their behavior at the molecular level is a major goal in heterogeneous catalyst research. However, conventional nanocatalysts have a nonuniform particle size distribution, while catalytic activity of nanoparticles is size dependent. This makes it difficult to relate the observed catalytic performance, which represents the average of all particle sizes, to the structure and intrinsic properties of individual catalyst particles. To overcome this obstacle, catalysts with well-defined particle size are highly desirable.In recent years, researchers have made remarkable advances in solution-phase synthesis of atomically precise nanoclusters, notably thiolate-protected gold nanoclusters. Such nanoclusters are composed of a precise number of metal atoms (n) and of ligands (m), denoted as Aun(SR)m, with n ranging up to a few hundred atoms (equivalent size up to 2–3 nm). These protected nanoclusters are well-defined ...

832 citations

Journal ArticleDOI
TL;DR: In this article, the authors present evidence from a variety of domains which demonstrates the prevalence of such projection bias, develop a formal model of it, and use this model to demonstrate its importance in economic environments.
Abstract: People exaggerate the degree to which their future tastes will resemble their current tastes. We present evidence from a variety of domains which demonstrates the prevalence of such projection bias, develop a formal model of it, and use this model to demonstrate its importance in economic environments. We show that, when people exhibit habit formation, projection bias leads people to consume too much early in life, and to decide, as time passes, to consume more— and save less— than originally planned. Projection bias can also lead to misguided purchases of durable goods. We discuss a number of additional applications and implications.

832 citations


Authors

Showing all 36645 results

NameH-indexPapersCitations
Yi Chen2174342293080
Rakesh K. Jain2001467177727
Robert C. Nichol187851162994
Michael I. Jordan1761016216204
Jasvinder A. Singh1762382223370
J. N. Butler1722525175561
P. Chang1702154151783
Krzysztof Matyjaszewski1691431128585
Yang Yang1642704144071
Geoffrey E. Hinton157414409047
Herbert A. Simon157745194597
Yongsun Kim1562588145619
Terrence J. Sejnowski155845117382
John B. Goodenough1511064113741
Scott Shenker150454118017
Network Information
Related Institutions (5)
Massachusetts Institute of Technology
268K papers, 18.2M citations

95% related

University of Maryland, College Park
155.9K papers, 7.2M citations

93% related

University of Illinois at Urbana–Champaign
225.1K papers, 10.1M citations

93% related

IBM
253.9K papers, 7.4M citations

93% related

Princeton University
146.7K papers, 9.1M citations

92% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
2023120
2022499
20214,981
20205,375
20195,420
20184,972