Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Michael H. Goldwasser"'
This book presents reviewed and revised papers from the fifth and sixth DIMACS Implementation Challenge workshops. These workshops, held approximately annually, aim at encouraging high-quality work in experimental analysis of data structures and algo
Autor:
Michael H. Goldwasser
Publikováno v:
ACM SIGACT News. 41:100-128
Over the past decade, there has been great interest in the study of buffer management policies in the context of packet transmission for network switches. In a typical model, a switch receives packets on one or more input ports, with each packet havi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::650a3c583a091437861b269ea6be8577
https://doi.org/10.1145/1753171.1753195
https://doi.org/10.1145/1753171.1753195
Autor:
Michael H. Goldwasser, David Letscher
Publikováno v:
SIGCSE
We describe cs1graphics, a new Python drawing package designed with pedagogy in mind. The package is simple enough that students can sit down and make use of it from the first day of an introductory class. Yet it provides seamless support for interme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc084940ad35a08c59d7730ecec052d6
https://doi.org/10.1145/1539024.1508945
https://doi.org/10.1145/1539024.1508945
Autor:
Michael H. Goldwasser, Mark Pedigo
Publikováno v:
ACM Transactions on Algorithms. 5:1-18
We consider the nonpreemptive scheduling of two identical machines for jobs with equal processing times yet arbitrary release dates and deadlines. Our objective is to maximize the number of jobs completed by their deadlines. Using standard nomenclatu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ab1a1819249327d2c9fb0bd81c52304
https://doi.org/10.1145/1435375.1435377
https://doi.org/10.1145/1435375.1435377
Publikováno v:
Information Processing Letters. 107:240-245
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the number of jobs completed by their deadlines. Chrobak et al. (2007, SICOMP 3
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9b0c569348f1ff8dad9ddff4d7616ad
https://doi.org/10.1016/j.ipl.2008.03.003
https://doi.org/10.1016/j.ipl.2008.03.003
The design and analysis of efficient data structures has long been recognized as a key component of the Computer Science curriculum. Goodrich, Tomassia and Goldwasser's approach to this classic topic is based on the object-oriented paradigm as the fr
Autor:
Michael H. Goldwasser, Xin He
Publikováno v:
Journal of Computational Biology. 12:638-656
The study of conserved gene clusters is important for understanding the forces behind genome organization and evolution, as well as the function of individual genes or gene groups. In this paper, we present a new model and algorithm for identifying c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9450e84184406d173e5b34049474d004
https://doi.org/10.1089/cmb.2005.12.638
https://doi.org/10.1089/cmb.2005.12.638
Autor:
Qi Cheng, Ming-Yang Kao, Gagan Aggarwal, Robert T. Schweller, Pablo Moisset de Espanés, Michael H. Goldwasser
Publikováno v:
SIAM Journal on Computing. 34:1493-1515
In this paper, we study the complexity of self-assembly under models that are natural generalizations of the tile self-assembly model. In particular, we extend Rothemund and Winfree's study of the tile complexity of tile self-assembly [Proceedings of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef762f5fead39f8c9d71cfc5236a1209
https://doi.org/10.1137/s0097539704445202
https://doi.org/10.1137/s0097539704445202
Based on the authors'market leading data structures books in Java and C++, this book offers a comprehensive, definitive introduction to data structures in Python by authoritative authors. Data Structures and Algorithms in Python is the first authorit
Autor:
Michael H. Goldwasser
Publikováno v:
SODA
We consider the online competitiveness for scheduling a single resource non-preemptively in order to maximize its utilization. Our work examines this model when parameterizing an instance by a new value which we term the patience. This parameter meas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f05354af26fd20dfae43f278ef3df43b
https://doi.org/10.1023/a:1022994010777
https://doi.org/10.1023/a:1022994010777