
The Library
Browse by Warwick Author
![]() | Up a level |
Number of items: 14.
2012
Fearnley, J., Goldberg, Paul W., Savani, Rahul and SΓΈrensen, Troels Bjerre (2012) Approximate well-supported Nash equilibria below two-thirds. In: Serna, Maria, (ed.) Algorithmic Game Theory. Berlin: Springer Verlag, pp. 108-119. ISBN 9783642339950
Goldberg, Paul W., Savani, Rahul, SΓΈrensen, Troels Bjerre and Ventre, Carmine (2012) On the approximation performance of fictitious play in finite games. International Journal of Game Theory . doi:10.1007/s00182-012-0362-6 ISSN 0020-7276.
2007
Palmer, Nick and Goldberg, Paul W. (2007) PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance. In: 16th Annual International Conference on Algorithmic Learning Theory (ALT 2005), Singapore, 08-11 Oct 2005. Published in: Theoretical Computer Science, Vol.387 (No.1). pp. 18-31. doi:10.1016/j.tcs.2007.07.023 ISSN 0304-3975.
2004
Palmer, N. and Goldberg, Paul W. (2004) PAC classification based on PAC estimates of label class distributions. University of Warwick. Department of Computer Science. (Department of Computer Science Research report). (Unpublished)
Berenbrink, Petra, Goldberg, Leslie Ann, Goldberg, Paul W. and Martin, R. (Russell) (2004) Utilitarian resource assignment. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
2001
Goldberg, Paul W. (2001) Learning fixed-dimension linear thresholds from fragmented data. Information and Computation, Volume 171 (Number 1). pp. 98-122. doi:10.1006/inco.2001.3059 ISSN 0890-5401.
Goldberg, Paul W. (2001) When can two unsupervised learners achieve PAC separation? In: Helmbold, D. and Williamson, B., (eds.) Computational Learning Theory. Lecture Notes in Computer Science, Volume 2111 . Springer Berlin Heidelberg, pp. 303-319. ISBN 9783540423430
Cryan, Mary, Goldberg, Leslie Ann and Goldberg, Paul W. (2001) Evolutionary trees can be learned in polynomial time in the two-state general Markov model. SIAM Journal on Computing, Volume 31 (Number 2). pp. 375-397. ISSN 0097-5397.
2000
Goldberg, Paul W. (2000) When can two unsupervised learners achieve PAC separation? University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)
1999
Goldberg, Paul W. (1999) Learning fixed-dimension linear thresholds from fragmented data. University of Warwick. Department of Computer Science. (Computer science research report). (Unpublished)
1998
Cryan, Mary, Goldberg, Leslie Ann and Goldberg, Paul W. (1998) Evolutionary trees can be learned in polynomial time in the two-state general Markov model. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
Goldberg, Leslie Ann, Goldberg, Paul W., Phillips, Cynthia A. and Sorkin, Gregory B. (1998) Constructing computer virus phylogenies. Journal of Algorithms, Volume 26 (Number 1). pp. 188-208. ISSN 0196-6774.
Cryan, Mary, Goldberg, Leslie Ann and Goldberg, Paul W. (1998) Evolutionary trees can be learned in polynomial time in the two-state general Markov model. In: 39th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, 08-11 Nov 1998. Published in: 39th Annual Symposium on Foundations of Computer Science, 1998. Proceedings. pp. 436-445. ISBN 0818691727. ISSN 0272-5428.
1996
Goldberg, Leslie Ann, Goldberg, Paul W., Phillips, Cynthia A. and Sorking, Gregory B. (1996) Constructing computer virus phylogenies. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
This list was generated on Sun Dec 3 17:08:07 2023 GMT.