Paul Young

Publication Activity (10 Years)

Years Active: 1971-2023
Publications (10 Years): 12

Top Topics

Dynamic Allocation

Top Venues

Ann. Oper. Res.

ACM Journal on Computing and Cultural Heritage

Publications

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