The SCEAS System
Navigation Menu

Search the dblp DataBase


Patricia J. Riddle: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Remco R. Bouckaert, Michael Goebel, Patricia J. Riddle
    Generalized Unified Decomposition of Ensemble Loss. [Citation Graph (0, 0)][DBLP]
    Australian Conference on Artificial Intelligence, 2006, pp:1133-1139 [Conf]
  2. Michael Goebel, Patricia J. Riddle, Mike Barley
    A Unified Decomposition of Ensemble Loss for Predicting Ensemble Performance. [Citation Graph (0, 0)][DBLP]
    ICML, 2002, pp:211-218 [Conf]
  3. Patricia J. Riddle
    Reformation from State Space to Reduction Space. [Citation Graph (0, 0)][DBLP]
    ML, 1989, pp:439-440 [Conf]
  4. Cameron Skinner, Patricia Riddle
    Expected Rates of Building Block Discovery, Retention and Combination Under 1-Point and Uniform Crossover. [Citation Graph (0, 0)][DBLP]
    PPSN, 2004, pp:121-130 [Conf]
  5. Philip G. K. Reiser, Patricia J. Riddle
    Evolving Logic Programs to Classify Chess-Endgame Positions. [Citation Graph (0, 0)][DBLP]
    SEAL, 1998, pp:138-145 [Conf]
  6. Patricia J. Riddle, Richard Segal, Oren Etzioni
    Representation design and brut-force induction in a Boeing manufacturing domain. [Citation Graph (0, 0)][DBLP]
    Applied Artificial Intelligence, 1994, v:8, n:1, pp:125-147 [Journal]
  7. Philip G. K. Reiser, Patricia J. Riddle
    Scaling Up Inductive Logic Programming: An Evolutionary Wrapper Approach. [Citation Graph (0, 0)][DBLP]
    Appl. Intell., 2001, v:15, n:3, pp:181-197 [Journal]
  8. Cameron Skinner, Patricia J. Riddle, Chris Triggs
    Mathematics prevents bloat [genetic programming]. [Citation Graph (0, 0)][DBLP]
    Congress on Evolutionary Computation, 2005, pp:390-395 [Conf]

  9. Ant Colony Optimization and the Single Round Robin Maximum Value Problem. [Citation Graph (, )][DBLP]

  10. DFS* and the Traveling Tournament Problem. [Citation Graph (, )][DBLP]

  11. An ant colony optimization approach to the traveling tournament problem. [Citation Graph (, )][DBLP]

  12. Random search can outperform mutation. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002