The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David Pritchard: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mircea Gh. Negoita, David Pritchard
    Testing Intelligent Tutoring System. [Citation Graph (0, 0)][DBLP]
    ICMLA, 2003, pp:98-104 [Conf]
  2. Mircea Gh. Negoita, David Pritchard
    Some Test Problems Regarding Intelligent Tutoring Systems. [Citation Graph (0, 0)][DBLP]
    KES, 2003, pp:986-992 [Conf]
  3. Mircea Gh. Negoita, David Pritchard
    Developing a "Virtual Student" Model to Test the Tutor and Optimizer Agents in an ITS. [Citation Graph (0, 0)][DBLP]
    KES, 2004, pp:240-252 [Conf]
  4. Mircea Gh. Negoita, David Pritchard
    An Optimiser Agent that Empowers an ITS System to "on-the-fly" Modify Its Teaching Strategies. [Citation Graph (0, 0)][DBLP]
    KES, 2004, pp:914-921 [Conf]
  5. David Pritchard, Wolfgang Heidrich
    Cloth motion capture. [Citation Graph (0, 0)][DBLP]
    SIGGRAPH, 2003, pp:- [Conf]
  6. David Pritchard, Santosh Vempala
    Symmetric network computation. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:261-270 [Conf]
  7. David Pritchard, Wolfgang Heidrich
    Cloth Motion Capture. [Citation Graph (0, 0)][DBLP]
    Comput. Graph. Forum, 2003, v:22, n:3, pp:263-272 [Journal]
  8. David Pritchard
    How to Use Random Circulations to Find Small Cuts [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  9. David Pritchard
    Nearest Neighbor Network Traversal [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  10. David Pritchard
    An Optimal Distributed Edge-Biconnectivity Algorithm [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  11. David Pritchard
    Efficient Divide-and-Conquer Simulations Of Symmetric FSAs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  12. Approximability of Sparse Integer Programs. [Citation Graph (, )][DBLP]


  13. A Fuzzy-Ga Hybrid Technique for Optimization of Teaching Sequences Presented in ITSs. [Citation Graph (, )][DBLP]


  14. Fast Distributed Computation of Cuts Via Random Circulations. [Citation Graph (, )][DBLP]


  15. A "virtual student" leads to the possibility of optimiser agents in an ITS. [Citation Graph (, )][DBLP]


  16. Hypergraphic LP Relaxations for Steiner Trees. [Citation Graph (, )][DBLP]


  17. Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees. [Citation Graph (, )][DBLP]


  18. Editorial. [Citation Graph (, )][DBLP]


  19. A Partition-Based Relaxation For Steiner Trees [Citation Graph (, )][DBLP]


  20. Approximability of Sparse Integer Programs [Citation Graph (, )][DBLP]


  21. Hypergraphic LP Relaxations for Steiner Trees [Citation Graph (, )][DBLP]


  22. Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) [Citation Graph (, )][DBLP]


  23. k-Edge-Connectivity: Approximation and LP Relaxation [Citation Graph (, )][DBLP]


  24. An LP with Integrality Gap 1+epsilon for Multidimensional Knapsack [Citation Graph (, )][DBLP]


  25. Integrality Gap of the Hypergraphic Relaxation of Steiner Trees: a short proof of a 1.55 upper bound [Citation Graph (, )][DBLP]


Search in 0.035secs, Finished in 0.035secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
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 asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002