default search action
Diarmuid Grimes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c23]Filipe Souza, Diarmuid Grimes, Barry O'Sullivan:
An Investigation of Generic Approaches to Large Neighbourhood Search (Short Paper). CP 2024: 39:1-39:10 - [i2]Séamus Lankford, Diarmuid Grimes:
Neural Architecture Search using Particle Swarm and Ant Colony Optimization. CoRR abs/2403.03781 (2024) - 2023
- [c22]Filipe Souza, Diarmuid Grimes, Barry O'Sullivan:
Improved Variable-Relationship Guided LNS for the Data Centre Machine Reassignment Problem. AICS 2023: 1-4 - 2022
- [c21]David Bowden
, Diarmuid Grimes
Intelligent Image Compression Using Traffic Scene Analysis. AICS 2022: 332-343 - [c20]Filipe Souza, Diarmuid Grimes, Barry O'Sullivan:
A Large Neighborhood Search Approach for the Data Centre Machine Reassignment Problem. AICS 2022: 397-408 - [c19]Filipe Souza, Diarmuid Grimes, Barry O'Sullivan:
Variable-Relationship Guided LNS for the Car Sequencing Problem. AICS 2022: 437-449 - 2021
- [c18]Séamus Lankford
Enhanced Neural Architecture Search Using Super Learner and Ensemble Approaches. ASSE 2021: 137-143 - [c17]Christian O'Leary, Conor Lynch, Rose Bain, Gary Smith, Diarmuid Grimes:
A Comparison of Deep Learning vs Traditional Machine Learning for Electricity Price Forecasting. ICICT 2021: 6-12 - 2020
- [j5]Mark Antunes, Vincent Armant
Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting. Int. J. Artif. Intell. Tools 29(03n04): 2060007:1-2060007:31 (2020) - [c16]Filipe Souza, Diarmuid Grimes:
Combining Local Search and Genetic Algorithm for Two-Dimensional Guillotine Bin Packing Problems with partial sequence constraint. AICS 2020: 97-108 - [c15]Séamus Lankford, Diarmuid Grimes:
Neural Architecture Search using Particle Swarm and Ant Colony Optimization. AICS 2020: 229-240
2010 – 2019
- 2018
- [c14]Mark Antunes, Vincent Armant, Kenneth N. Brown, Daniel A. Desmond, Guillaume Escamocher, Anne-Marie George
Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting. ICTAI 2018: 114-121 - 2017
- [c13]Mohamed Wahbi
A Distributed Optimization Method for the Geographically Distributed Data Centres Problem. CPAIOR 2017: 147-166 - 2016
- [c12]J. Ignacio Torrens
Integrated Energy Efficient Data Centre Management for Green Cloud Computing - The FP7 GENiC Project Experience. CLOSER (2) 2016: 375-386 - [c11]Diarmuid Grimes, Deepak Mehta, Barry O'Sullivan
Robust Server Consolidation: Coping with Peak Demand Underestimation. MASCOTS 2016: 271-276 - 2015
- [j4]Diarmuid Grimes, Emmanuel Hebrard
Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search. INFORMS J. Comput. 27(2): 268-284 (2015) - [c10]Diarmuid Grimes, Barry Hurley, Deepak Mehta, Barry O'Sullivan
Large Neighbourhood Search for Energy-Efficient Train Timetabling. ICTAI 2015: 828-835 - 2014
- [j3]Diarmuid Grimes, Georgiana Ifrim
Analyzing the impact of electricity price forecasting on energy cost-aware scheduling. Sustain. Comput. Informatics Syst. 4(4): 276-291 (2014) - 2012
- [b1]Diarmuid Grimes:
Identifying sources of global contention in constraint satisfaction search. University College Cork, Republic of Ireland, 2012 - 2011
- [c9]Diarmuid Grimes, Emmanuel Hebrard
Models and Strategies for Variants of the Job Shop Scheduling Problem. CP 2011: 356-372 - [i1]Diarmuid Grimes, Emmanuel Hebrard:
Models and Strategies for Variants of the Job Shop Scheduling Problem. CoRR abs/1109.5920 (2011) - 2010
- [j2]Nic Wilson
Interleaving solving and elicitation of constraint satisfaction problems based on expected cost. Constraints An Int. J. 15(4): 540-573 (2010) - [c8]Diarmuid Grimes, Emmanuel Hebrard
Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach. CPAIOR 2010: 147-161
2000 – 2009
- 2009
- [c7]Diarmuid Grimes, Emmanuel Hebrard
Closing the Open Shop: Contradicting Conventional Wisdom. CP 2009: 400-408 - [c6]Richard J. Wallace, Diarmuid Grimes, Eugene C. Freuder:
Dynamic Constraint Satisfaction Problems: Relations among Search Strategies, Solution Sets and Algorithm Performance. CSCLP 2009: 105-121 - [c5]Richard J. Wallace, Diarmuid Grimes, Eugene C. Freuder:
Solving Dynamic Constraint Satisfaction Problems by Identifying Stable Features. IJCAI 2009: 621-627 - 2008
- [j1]Richard J. Wallace, Diarmuid Grimes:
Experimental studies of variable selection strategies based on constraint weights. J. Algorithms 63(1-3): 114-129 (2008) - [c4]Richard J. Wallace, Diarmuid Grimes, Eugene C. Freuder:
Solving Dynamic Constraint Satisfaction Problems by Identifying Stable Features. RCRA 2008 - 2007
- [c3]Nic Wilson
A Cost-Based Model and Algorithms for Interleaving Solving and Elicitation of CSPs. CP 2007: 666-680 - [c2]Diarmuid Grimes, Richard J. Wallace:
Sampling Strategies and Variable Selection in Weighted Degree Heuristics. CP 2007: 831-838 - [c1]Diarmuid Grimes, Richard J. Wallace:
Learning to Identify Global Bottlenecks in Constraint Satisfaction Search. FLAIRS 2007: 592-597
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-10-07 21:23 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: