Paul Young - RankMe

71 papers A* 4B 2C 3Misc 7Journal 39Unranked 16

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Exploring the Relationship Between Social Media Use and Symptoms of Depression and Anxiety Among Children and Adolescents: A Systematic Narrative Review. Cyberpsychology Behav. Soc. Netw. Naila Saleem, Paul Young, Saman Yousuf
2023	J	`jnl`	Can Hierarchical Transformers Learn Facial Geometry? Sensors Paul Young, Nima Ebadi, Arun Das, Mazal Bethany, Kevin Desai, Peyman Najafirad
2022	J	`jnl`	Alexa, Is This a Historical Record? ACM Journal on Computing and Cultural Heritage Santhilata Kuppili Venkata, Paul Young, Mark Bell, Alex Green
2021	—	`conf`	Text File Format Identification: An Application of AI for the Curation of Digital Records. iPRES Santhilata Kuppili Venkata, Paul Young, Alex Green
2020	—	`conf`	Models in the Cloud: Exploring Next Generation Environmental Software Systems. ISESS William Simm, Gordon S. Blair, Richard Bassett, Faiza Samreen, Paul Young
2019	J	`jnl`	Intelligent self-designing production control strategy: Dynamic allocation hybrid pull-type mechanism applicable to closed-loop supply chains. Comput. Ind. Eng. Jonathan Ebner, Paul Young, John Geraghty
2018	Misc	`conf`	Generalization of EF-based Assignment Strategies for Cycle Time Optimization at Complex wet Stations. WSC Anna Rotondo, John Geraghty, Paul Young
2018	J	`jnl`	Generating Music using an LSTM Network. CoRR Nikhil Kotecha, Paul Young
2017	—	`conf`	Performance of Scientific Simulations on QCT Developer Cloud: A Case Study of Molecular Dynamic and Quantum Chemistry Simulations. CSCloud Prabha Madhavan, Paul Young, Stephen Chang
2017	—	`conf`	Power and Performance Study of HPC Applications on QCT Developer Cloud. CSCloud Paul Young, Probha Madhavan, Gong-Do Hwang
2016	J	`jnl`	An Eight-year Study of the Influence of IT Career Camps on Altering Perceptions of IT Majors and Careers. Commun. Assoc. Inf. Syst. James P. Downey, Summer E. Bartczak, Paul Young, Ellen England
2015	J	`jnl`	Sequencing optimisation for makespan improvement at wet-etch tools. Comput. Oper. Res. Anna Rotondo, Paul Young, John Geraghty
2015	—	`conf`	Variable intensity RCPSP approach to a case study flow shop. SummerSim Oladipupo Olaitan, Paul Young, John Geraghty
2013	Misc	`conf`	Quality risk analysis at sampling stations crossed by one monitored product and an unmonitored flow. WSC Anna Rotondo, John Geraghty, Paul Young
2013	J	`jnl`	Quality risk prediction at a non-sampling station machine in a multi-product, multi-stage, parallel processing manufacturing system subjected to sequence disorder and multiple stream effects. Ann. Oper. Res. Anna Rotondo, Paul Young, John Geraghty
2012	—	`conf`	Evaluation of issue-tracker's effectiveness for measuring individual performance on group projects. ACM Southeast Regional Conference Paul Young, V. Yip, R. B. Lenin
2012	—	`conf`	The Demand Response Spinning Reserve Demonstration-Measuring the Speed and Magnitude of Aggregated Demand Response. HICSS Joseph H. Eto, Janine Nelson-Hoffman, Eric Parker, Clark Bernier, Paul Young, Dave Sheehan, John Kueck, Brendan J. Kirby
2012	Misc	`conf`	Using simulation and hybrid sequencing optimization for makespan reduction at a wet tool. WSC Anna Rotondo, John Geraghty, Paul Young
2011	J	`jnl`	Collaboration problems in conducting a group project in a software engineering course. J. Comput. Sci. Coll. Priyatham Anisetty, Paul Young
2011	C	`conf`	Hardware/software implementation of PI/PD-like fuzzy controller for high performance motor drives. IAS Ahmed Rubaai, Paul Young
2010	C	`conf`	DSP-Based Fuzzy Neural Network PI/PD-Like Fuzzy Controller for Motion Controls and Drives. IAS Ahmed Rubaai, Paul Young
2010	J	`jnl`	Special issue on optimisation methods & applications in decision-making processes. Appl. Soft Comput. Arijit Bhattacharya, Sani Susanto, John Geraghty, Paul Young
2010	J	`jnl`	Supplier selection paradigm: An integrated hierarchical QFD methodology under multiple-criteria environment. Appl. Soft Comput. Arijit Bhattacharya, John Geraghty, Paul Young
2009	Misc	`conf`	A Modular Distributed Decision Support System with Data Mining Capabilities. HAIS Leonardo Gualano, Paul Young
2009	—	`conf`	On the Analytical Framework of Resilient Supply-Chain Network Assessing Excursion Events. Asia International Conference on Modelling and Simulation Arijit Bhattacharya, John Geraghty, Paul Young
2008	Misc	`conf`	Time-Limited Next Arrival heuristic for batch processing and setup reduction in a re-entrant environment. WSC Stephen Murray, John Geraghty, Paul Young, Steve Sievwright
2006	—	`conf`	A Case Study in Applying Semantic Web Technologies to the XML-Based Tactical Assessment Markup Language (TAML). AAAI Fall Symposium: Semantic Web for Collaborative Knowledge Acquisition Candace Childers, Don Brutzman, Curtis L. Blais, Paul Young
2004	Misc	`conf`	Intelligent Simulation-Based Lot Scheduling of Photolithography Toolsets in a Wafer Fabrication Facility. WSC Amr Arisha, Paul Young
2003	C	`conf`	Evaluation of Middleware Architectures in Achieving System Interoperability. IEEE International Workshop on Rapid System Prototyping Paul Young, Nabendu Chaki, Valdis Berzins, Luqi
2002	Misc	`conf`	Using an object oriented model for resolving representational differences between heterogeneous systems. SAC Paul Young, Valdis Berzins, Jun Ge, Luqi
1994	—	`conf`	Collapsing Degrees in Subexponential Time. SCT Deborah Joseph, Randall J. Pruim, Paul Young
1993	J	`jnl`	A Note on Bi-immunity and p-Closeness of p-Cheatable Sets in P/Poy. J. Comput. Syst. Sci. Judy Goldsmith, Deborah Joseph, Paul Young
1993	—	`conf`	In The Meaning Of Essentially Unprovable Theorems In The Presburger Theory Of Addition. Kurt Gödel Colloquium Giovanni Faglia, Paul Young
1993	J	`jnl`	Using Self-Reducibilities to Characterize Polynomial Time Inf. Comput. Judy Goldsmith, Deborah Joseph, Paul Young
1992	J	`jnl`	How reductions to sparse sets collapse the polynomial-time hierarchy: a primer: Part II restricted polynomial-time reductions. SIGACT News Paul Young
1992	J	`jnl`	How reductions to sparse sets collapse the polynomial-time hierarchy: a primer; part I: polynomial-time Turing reductions. SIGACT News Paul Young
1991	J	`jnl`	Near-Testable Sets. SIAM J. Comput. Judy Goldsmith, Lane A. Hemachandra, Deborah Joseph, Paul Young
1991	J	`jnl`	On Sets Polynomially Enumerable by Iteration. Theor. Comput. Sci. Lane A. Hemachandra, Albrecht Hoene, Dirk Siefkes, Paul Young
1990	J	`jnl`	Cook Reducibility is Faster than Karp Reduciblity in NP. J. Comput. Syst. Sci. Luc Longpré, Paul Young
1990	J	`jnl`	Strong Separations for the Boolean Hierarchy over RP. Int. J. Found. Comput. Sci. Danilo Bruschi, Deborah Joseph, Paul Young
1989	J	`jnl`	1988 Snowbird Report: A Discipline Matures. Computer David Gries, Terry Walker, Paul Young
1989	—	`conf`	A Structural Overview of NP Optimization Problems. Optimal Algorithms Danilo Bruschi, Deborah Joseph, Paul Young
1989	B	`conf`	Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract). FCT Alberto Bertoni, Danilo Bruschi, Deborah Joseph, Meera Sitharam, Paul Young
1989	J	`jnl`	The 1988 Snowbird Report: A Discipline Matures. Commun. ACM David Gries, Terry Walker, Paul Young
1988	—	`conf`	Cook is faster than Karp: a study of reducibilities in NP. SCT Luc Longpré, Paul Young
1988	—	`conf`	Juris Hartmanis: fundamental contributions to isomorphism problems. SCT Paul Young
1988	J	`jnl`	The Structural Complexity Column, guest authors. Bull. EATCS Deborah Joseph, Paul Young
1987	—	`conf`	Self-Reducible, P-Selectlve, Near-Testable, Near-Testable, and P-Cheatable Sets: The Effect of Internal Structure on the Complexity of a Set. SCT Judy Goldsmith, Deborah Joseph, Paul Young
1986	J	`jnl`	Imbalance Between Growth and Funding in Academic Computing Science: Two Trends Colliding. Commun. ACM David Gries, Raymond E. Miller, Robert W. Ritchie, Paul Young
1986	J	`jnl`	Imbalance Between Growth and Funding in Academic Computing Science: Two Trends Colliding. Computer David Gries, Raymond E. Miller, Robert W. Ritchie, Paul Young
1985	J	`jnl`	Reductions Among Polynomial Isomorphism Types. Theor. Comput. Sci. Stephen R. Mahaney, Paul Young
1985	J	`jnl`	Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP. Theor. Comput. Sci. Deborah Joseph, Paul Young
1983	J	`jnl`	Discontinuities of Provably Correct Operators on the Provably Recursive Real Numbers. J. Symb. Log. William J. Collins, Paul Young
1983	A*	`conf`	Some Structural Properties of Polynomial Reducibilities and Sets in NP STOC Paul Young
1982	J	`jnl`	Corrigendum: Independence Results in Computer Science? J. Comput. Syst. Sci. Deborah Joseph, Paul Young
1982	J	`jnl`	Introduction Inf. Control. Martin Davis, Carl Smith, Paul Young
1982	J	`jnl`	Introduction Inf. Control. Martin Davis, Carl Smith, Paul Young
1981	B	`conf`	A Survey of Some Recent Results on Computational Complexity in Weak Theories of Arithmetic. MFCS Deborah Joseph, Paul Young
1981	A*	`conf`	Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (Preliminary Abstract) STOC Deborah Joseph, Paul Young
1981	J	`jnl`	Independence Results in Computer Science? J. Comput. Syst. Sci. Deborah Joseph, Paul Young
1981	J	`jnl`	Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems. J. Comput. Syst. Sci. Michael Machtey, Paul Young
1980	A*	`conf`	Independence Results in Computer Science? (Preliminary Version) STOC Deborah Joseph, Paul Young
1978	J	`jnl`	Simple Gödel Numberings, Isomorphisms, and Programming Properties. SIAM J. Comput. Michael Machtey, Karl Winklmann, Paul Young
1977	J	`jnl`	Optimization Among Provably Equivalent Programs. J. ACM Paul Young
1976	A*	`conf`	Simple Gödel Numberings, Translations, and the P-Hierarchy STOC Michael Machtey, Paul Young
1974	J	`jnl`	Corrigendum: Speed-ups by Changing the Order in which Sets are Enumerated. Math. Syst. Theory Paul Young
1973	—	`conf`	Optimization among Provably Equivalent Programs (Preliminary Abstract) SWAT Paul Young
1973	J	`jnl`	Ordinal Hierarchies and Naming Complexity Classes. J. ACM Leonard J. Bass, Paul Young
1971	J	`jnl`	A Note on Dense and Nondense Families of Complexity Classes. Math. Syst. Theory Paul Young
1971	J	`jnl`	On Size vs. Efficiency for Programs Admitting Speed-Ups. J. Symb. Log. John Helm, Paul Young
1971	J	`jnl`	Speed-Ups by Changing the Order in which Sets are Enumerated. Math. Syst. Theory Paul Young