Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

Catherine McGeoch

Known as: McGeoch 
Catherine Cole McGeoch is an American computer scientist specializing in empirical algorithmics and heuristics for NP-hard problems. She is currently… 
Wikipedia

Related topics

Related topics

4 relations
Computer scientistD-Wave TwoEmpirical algorithmicsThe New York Times

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2019
Highly Cited
2019
Quantum Annealing amid Local Ruggedness and Global Frustration
A recent Google study [Phys. Rev. X, 6:031015 (2016)] compared a D-Wave 2X quantum processing unit (QPU) to two classical Monte… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2017
2017
Is quantum computing for real?: an interview with Catherine McGeoch of D-Wave Systems
In this interview, computer scientist Catherine McGeoch demystifies quantum computing and introduces us to a new world of… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Review
2017
Review
2017
Monitoring biodiversity change through effective global coordination
The ability to monitor changes in biodiversity, and their societal impact, is critical to conserving species and managing… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Review
2007
Review
2007
Global dung beetle response to tropical forest modification and fragmentation: A quantitative literature review and meta-analysis
Although insects are crucial for maintaining ecosystem function, our understanding of their overall response to human activity… 
  • table 1
  • figure 1
  • table 2
  • table 3
Highly Cited
2003
Highly Cited
2003
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
Abstract. Dantzig, Fulkerson, and Johnson (1954) introduced the cutting-plane method as a means of attacking the traveling… 
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Highly Cited
2001
Highly Cited
2001
Experimental Analysis of Heuristics for the Stsp
  • figure 1.2
  • figure 1.4
  • figure 1.6
  • figure 1.12
  • figure 1.13
Review
1999
Review
1999
A theoretician's guide to the experimental analysis of algorithms
  • David S. Johnson
  • Data Structures, Near Neighbor Searches, and…
  • 1999
  • Corpus ID: 11281694
This paper presents an informal discussion of issues that arise when one attempts to analyze algorithms experimentally. It is… 
  • figure 1
  • figure 2
1997
1997
Proactive interference plays a role in the word-length effect
The word-length effect is the advantage that lists of short words show over lists of long words in immediate recall. Typically… 
  • figure 1
  • figure 2
Highly Cited
1991
Highly Cited
1991
The harmonic online K-server algorithm is competitive
We show that the Harmonic algorithm for the online K-server problem is ( ~11 x 2K – 2K)competitive against an adaptive online… 
Highly Cited
1990
Highly Cited
1990
Affective Responses to Autobiographical Memories and Their Relationship to Long‐Term Goals
It was hypothesized that affective responses to memories could be predicted from a memory's relevance to the attainment or… 
  • table 2
  • table 4
  • table 7
  • table 8
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE