default search action
Michael D. Moffitt
Person information
- affiliation: Google, Austin, TX, USA
- affiliation (former): IBM Research, Austin, TX, USA
- affiliation (former, PhD 2007): University of Michigan, Ann Arbor, MI, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c27]Michael D. Moffitt
:
MiniMalloc: A Lightweight Memory Allocator for Hardware-Accelerated Machine Learning. ASPLOS (4) 2023: 238-252 - 2022
- [c26]Michael D. Moffitt:
Search Strategies for Topological Network Optimization. AAAI 2022: 10299-10308
2010 – 2019
- 2018
- [j7]Ethan L. Schreiber, Richard E. Korf, Michael D. Moffitt:
Optimal Multi-Way Number Partitioning. J. ACM 65(4): 24:1-24:61 (2018) - 2014
- [c25]Richard E. Korf, Ethan L. Schreiber, Michael D. Moffitt:
Optimal Sequential Multi-Way Number Partitioning. ISAIM 2014 - 2013
- [c24]Michael D. Moffitt:
Multidimensional Bin Packing Revisited. CP 2013: 513-528 - [c23]Michael D. Moffitt, Gernot E. Günther, Kevin A. Pasnik:
Place and route for massively parallel hardware-accelerated functional verification. ICCAD 2013: 466-472 - [c22]Michael D. Moffitt:
Search Strategies for Optimal Multi-Way Number Partitioning. IJCAI 2013: 623-629 - 2011
- [j6]Michael D. Moffitt:
On the modelling and optimization of preferences in constraint-based temporal reasoning. Artif. Intell. 175(7-8): 1390-1409 (2011) - [c21]Michael D. Moffitt, Gernot E. Günther:
Scalable Scheduling for Hardware-Accelerated Functional Verification. ICAPS 2011 - [c20]Michael D. Moffitt, Chin Ngai Sze:
Wire synthesizable global routing for timing closure. ASP-DAC 2011: 545-550 - [c19]Michael D. Moffitt, Mátyás A. Sustik, Paul G. Villarrubia:
Robust partitioning for hardware-accelerated functional verification. DAC 2011: 854-859 - 2010
- [j5]Richard E. Korf, Michael D. Moffitt, Martha E. Pollack:
Optimal rectangle packing. Ann. Oper. Res. 179(1): 261-295 (2010) - [j4]David A. Papa, Michael D. Moffitt, Charles J. Alpert, Igor L. Markov:
Speeding Up Physical Synthesis with Transactional Timing Analysis. IEEE Des. Test Comput. 27(5): 14-25 (2010) - [c18]Charles J. Alpert, Zhuo Li, Michael D. Moffitt, Gi-Joon Nam, Jarrod A. Roy, Gustavo E. Téllez:
What makes a design difficult to route. ISPD 2010: 7-12
2000 – 2009
- 2009
- [c17]Michael D. Moffitt:
Global routing revisited. ICCAD 2009: 805-808 - 2008
- [j3]Michael D. Moffitt:
MaizeRouter: Engineering an Effective Global Router. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(11): 2017-2026 (2008) - [j2]David A. Papa, Tao Luo, Michael D. Moffitt, Chin Ngai Sze, Zhuo Li, Gi-Joon Nam, Charles J. Alpert, Igor L. Markov:
RUMBLE: An Incremental Timing-Driven Physical-Synthesis Optimization Algorithm. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(12): 2156-2168 (2008) - [j1]Michael D. Moffitt, Jarrod A. Roy, Igor L. Markov, Martha E. Pollack:
Constraint-driven floorplan repair. ACM Trans. Design Autom. Electr. Syst. 13(4): 67:1-67:13 (2008) - [c16]Michael D. Moffitt:
MaizeRouter: Engineering an effective global router. ASP-DAC 2008: 226-231 - [c15]Michael D. Moffitt, David A. Papa, Zhuo Li, Charles J. Alpert:
Path smoothing via discrete optimization. DAC 2008: 724-727 - [c14]David A. Papa, Tao Luo, Michael D. Moffitt, Chin Ngai Sze, Zhuo Li, Gi-Joon Nam, Charles J. Alpert, Igor L. Markov:
RUMBLE: an incremental, timing-driven, physical-synthesis optimization algorithm. ISPD 2008: 2-9 - [c13]Michael D. Moffitt, Jarrod A. Roy, Igor L. Markov:
The coming of age of (academic) global routing. ISPD 2008: 148-155 - 2007
- [b1]Michael D. Moffitt:
Efficient and expressive extensions of constraint-based temporal reasoning. University of Michigan, USA, 2007 - [c12]Michael D. Moffitt:
On the Partial Observability of Temporal Uncertainty. AAAI 2007: 1031-1037 - [c11]Michael D. Moffitt, Martha E. Pollack:
Generalizing Temporal Controllability. IJCAI 2007: 1985-1990 - 2006
- [c10]Michael D. Moffitt, Martha E. Pollack:
Temporal Preference Optimization as Weighted Constraint Satisfaction. AAAI 2006: 110-116 - [c9]Michael D. Moffitt, Martha E. Pollack:
Optimal Rectangle Packing: A Meta-CSP Approach. ICAPS 2006: 93-102 - [c8]Michael D. Moffitt, Aaron N. Ng, Igor L. Markov, Martha E. Pollack:
Constraint-driven floorplan repair. DAC 2006: 1103-1108 - 2005
- [c7]Michael D. Moffitt, Bart Peintner, Martha E. Pollack:
Augmenting Disjunctive Temporal Problems with Finite-Domain Constraints. AAAI 2005: 1187-1192 - [c6]Pauline M. Berry, Melinda T. Gervasio, Tomás E. Uribe, Martha E. Pollack, Michael D. Moffitt:
A Personalized Time Management Assistant: Research Directions. AAAI Spring Symposium: Persistent Assistants: Living and Working with AI 2005: 1-6 - [c5]Bart Peintner, Michael D. Moffitt, Martha E. Pollack:
Solving Over-constrained Disjunctive Temporal Problems with Preferences. ICAPS 2005: 202-211 - [c4]Michael D. Moffitt, Martha E. Pollack:
Partial Constraint Satisfaction of Disjunctive Temporal Problems. FLAIRS 2005: 715-720 - [c3]Mark H. Liffiton, Michael D. Moffitt, Martha E. Pollack, Karem A. Sakallah:
Identifying Conflicts in Overconstrained Temporal Problems. IJCAI 2005: 205-211 - [c2]Michael D. Moffitt, Martha E. Pollack:
Applying Local Search to Disjunctive Temporal Problems. IJCAI 2005: 242-247 - [c1]Melinda T. Gervasio, Michael D. Moffitt, Martha E. Pollack, Joseph M. Taylor, Tomás E. Uribe:
Active preference learning for personalized calendar scheduling assistance. IUI 2005: 90-97
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: