default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDeepak Mehta 0001
Person information
- affiliation: United Technologies Research Center, Cork, Ireland
- affiliation (PhD 2009): University College Cork, Ireland
Other persons with the same name
- Deepak Mehta 0002
![[0000-0001-8502-1203]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-8502-1203")
— Lovely Professional University, Faculty of Technology and Sciences, Phagwara, India - Deepak Mehta 0003 — Sanskriti University, Department of Management, Mathura, India
- Deepak Mehta 0004 — National Agri-Food Biotechnology Institute, Mohali, India
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j6]Faeq Alrimawi, Liliana Pasquale, Deepak Mehta, Nobukazu Yoshioka, Bashar Nuseibeh:
Incidents are Meant for Learning, Not Repeating: Sharing Knowledge About Security Incidents in Cyber-Physical Systems. IEEE Trans. Software Eng. 48(2): 120-134 (2022)- 2021
- [j5]Michele Garraffa, Deepak Mehta, Barry O'Sullivan, Cemalettin Ozturk, Luis Quesada:
An adaptive large neighbourhood search algorithm for diameter bounded network design problems. J. Heuristics 27(5): 887-922 (2021) - 2020
- [p3]Amaro de Sousa, Jacek Rak, Fábio Barbosa, Dorabella Santos, Deepak Mehta:
Improving the Survivability of Carrier Networks to Large-Scale Disasters. Guide to Disaster-Resilient Communication Networks 2020: 175-192
2010 – 2019
- 2019
- [c55]Satyanarayana Vuppala, Alie El-Din Mady, Deepak Mehta:
A Novel Asset Authentication Scheme for Cyber Physical Systems. GIoTS 2019: 1-5 - [c54]Andrea Balogh, Deepak Mehta, Piotr Sobonski, Alieldin Mady, Satyanarayana Vuppala:
Learning Constraint-Based Model for Detecting Malicious Activities in Cyber Physical Systems. SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI 2019: 1392-1399 - [i5]Faeq Alrimawi, Liliana Pasquale, Deepak Mehta, Nobukazu Yoshioka, Bashar Nuseibeh:
Incidents Are Meant for Learning, Not Repeating: Sharing Knowledge About Security Incidents in Cyber-Physical Systems. CoRR abs/1907.00199 (2019) - 2018
- [j4]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem. J. Heuristics 24(3): 359-394 (2018) - [c53]Faeq Alrimawi, Liliana Pasquale, Deepak Mehta, Bashar Nuseibeh:
I've seen this before: sharing cyber-physical incident knowledge. SEAD@ICSE 2018: 33-40 - [p2]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
Parallel Constraint-Based Local Search: An Application to Designing Resilient Long-Reach Passive Optical Networks. Handbook of Parallel Constraint Reasoning 2018: 633-665 - 2017
- [c52]Mohamed Wahbi, Diarmuid Grimes, Deepak Mehta, Kenneth N. Brown, Barry O'Sullivan:
A Distributed Optimization Method for the Geographically Distributed Data Centres Problem. CPAIOR 2017: 147-166 - [c51]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Ata Sasmaz:
Generation of a reference network for Ireland and its contribution to the design of an optical network architecture. ICTON 2017: 1-4 - 2016
- [j3]Jesús Omana Iglesias, Milan De Cauwer, Deepak Mehta, Barry O'Sullivan, Liam Murphy:
Increasing task consolidation efficiency by using more accurate resource estimations. Future Gener. Comput. Syst. 56: 407-420 (2016) - [c50]J. Ignacio Torrens, Deepak Mehta, Vojtech Zavrel, Diarmuid Grimes, Thomas Scherer, Robert Birke, Lydia Y. Chen, Susan Rea, Lara Lopez, Enric Pages, Dirk Pesch:
Integrated Energy Efficient Data Centre Management for Green Cloud Computing - The FP7 GENiC Project Experience. CLOSER (2) 2016: 375-386 - [c49]Milan De Cauwer, Deepak Mehta, Barry O'Sullivan:
The Temporal Bin Packing Problem: An Application to Workload Management in Data Centres. ICTAI 2016: 157-164 - [c48]Diarmuid Grimes, Deepak Mehta, Barry O'Sullivan, Robert Birke, Lydia Y. Chen, Thomas Scherer, Ignacio Castiñeiras:
Robust Server Consolidation: Coping with Peak Demand Underestimation. MASCOTS 2016: 271-276 - [c47]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
Comparing tree and chain topologies for designing resilient backhaul access network. ONDM 2016: 1-6 - [p1]Barry Hurley, Lars Kotthoff, Yuri Malitsky, Deepak Mehta, Barry O'Sullivan:
Advanced Portfolio Techniques. Data Mining and Constraint Programming 2016: 191-225 - [i4]Barry Hurley, Deepak Mehta, Barry O'Sullivan:
Elastic Solver: Balancing Solution Time and Energy Consumption. CoRR abs/1605.06940 (2016) - 2015
- [c46]Danuta Sorina Chisca, Ignacio Castiñeiras, Deepak Mehta, Barry O'Sullivan:
On Energy- and Cooling-Aware Data Centre Workload Management. CCGRID 2015: 1111-1114 - [c45]Ignacio Castiñeiras, Deepak Mehta, Barry O'Sullivan:
Energy cost minimisation of geographically distributed data centres. CloudNet 2015: 279-284 - [c44]Deepak Mehta, Barry O'Sullivan, Cemalettin Ozturk, Luis Quesada:
An adaptive large neighbourhood search for designing transparent optical core network. ConTEL 2015: 1-8 - [c43]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan:
Constraint-Based Local Search for Finding Node-Disjoint Bounded-Paths in Optical Access Networks. CP 2015: 499-507 - [c42]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
A Constraint-Based Local Search for Edge Disjoint Rooted Distance-Constrained Minimum Spanning Tree Problem. CPAIOR 2015: 31-46 - [c41]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
Optimising dual homing for long-reach passive optical networks. DRCN 2015: 235-242 - [c40]Deepak Mehta, Barry O'Sullivan, Luis Quesada:
Extending the Notion of Preferred Explanations for Quantified Constraint Satisfaction Problems. ICTAC 2015: 309-327 - [c39]Diarmuid Grimes, Barry Hurley, Deepak Mehta, Barry O'Sullivan:
Large Neighbourhood Search for Energy-Efficient Train Timetabling. ICTAI 2015: 828-835 - [c38]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Cemalettin Ozturk, Luis Quesada:
A scalable approach for computing distance-bounded node-disjoint paths in optical networks. ICTON 2015: 1-4 - [c37]Deepak Mehta, Barry O'Sullivan, Cemalletin Ozturk, Luis Quesada:
Computing distance-bounded node-disjoint paths for all pairs of nodes - An application to optical core network design. RNDM@WMNC 2015: 71-77 - [c36]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
A constraint-based local search for designing tree networks with distance and disjoint constraints. RNDM@WMNC 2015: 128-134 - [c35]Ignacio Castiñeiras, Danuta Sorina Chisca, Deepak Mehta, Barry O'Sullivan:
Trichotomic Search for Thermal-Aware Data Centre Workload Optimisation. UCC 2015: 528-533 - [c34]Dirk Pesch, Alan McGibney, Piotr Sobonski, Susan Rea, Thomas Scherer, Lydia Yiyu Chen, Ton Engbersen, Deepak Mehta, Barry O'Sullivan, Enric Pages, Jacinta Townley, Dhanaraja Kasinathan, J. Ignacio Torrens, Vojtech Zavrel, J. L. M. Hensen:
The GENiC Architecture for Integrated Data Centre Energy Management. UCC 2015: 540-546 - [i3]Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Helmut Simonis:
Bin Packing with Linear Usage Costs. CoRR abs/1509.06712 (2015) - 2014
- [c33]Milan De Cauwer, Deepak Mehta, Barry O'Sullivan, Helmut Simonis, Hadrien Cambazard:
Proactive Workload Consolidation for Reducing Energy Cost over a Given Time Horizon. CCGRID 2014: 558-561 - [c32]David Lesaint, Deepak Mehta, Barry O'Sullivan, Vincent Vigneron:
A Decomposition Approach for Discovering Discriminative Motifs in a Sequence Database. ECAI 2014: 1057-1058 - [c31]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
Constraint-Based Local Search for the Distance- and Capacity-Bounded Network Design Problem. ICTAI 2014: 178-185 - [c30]David Lesaint, Deepak Mehta, Barry O'Sullivan, Vincent Vigneron:
A Decomposition Approach for Discovering Discriminative Motifs in a Sequence Database. ICTAI 2014: 544-551 - [c29]Deepak Mehta, Barry O'Sullivan, Cemalettin Ozturk, Luis Quesada, Helmut Simonis:
Designing an Optical Island in the Core Network: From Routing to Spectrum Allocation. ICTAI 2014: 560-567 - [c28]Deepak Mehta, Barry O'Sullivan, Luis Quesada, Marco Ruffini, David B. Payne, Linda Doyle:
A scalable optimisation approach to minimising IP protection capacity for Long-Reach PON. ONDM 2014: 31-36 - [c27]Jesús Omana Iglesias, Liam Murphy, Milan De Cauwer, Deepak Mehta, Barry O'Sullivan:
A Methodology for Online Consolidation of Tasks through More Accurate Resource Estimations. UCC 2014: 89-98 - [i2]David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson:
Developing Approaches for Solving a Telecommunications Feature Subscription Problem. CoRR abs/1401.3842 (2014) - 2013
- [c26]Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Helmut Simonis:
Bin Packing with Linear Usage Costs - An Application to Energy Management in Data Centres. CP 2013: 47-62 - [c25]Yuri Malitsky, Deepak Mehta, Barry O'Sullivan, Helmut Simonis:
Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem. CPAIOR 2013: 176-192 - [c24]Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Helmut Simonis:
Constraint Programming Based Large Neighbourhood Search for Energy Minimisation in Data Centres. GECON 2013: 44-59 - [c23]Deepak Mehta, Barry O'Sullivan, Lars Kotthoff, Yuri Malitsky:
Lazy Branching for Constraint Satisfaction. ICTAI 2013: 1012-1019 - [c22]Marco Collautti, Yuri Malitsky, Deepak Mehta, Barry O'Sullivan:
SNNAP: Solver-Based Nearest Neighbor for Algorithm Portfolios. ECML/PKDD (3) 2013: 435-450 - [c21]Yuri Malitsky, Deepak Mehta, Barry O'Sullivan:
Evolving Instance Specific Algorithm Configuration. SOCS 2013: 133-140 - [c20]Deepak Mehta, Barry O'Sullivan, Helmut Simonis:
Energy Cost Management for Geographically Distributed Data Centres under Time-Variable Demands and Energy Prices. UCC 2013: 26-33 - 2012
- [j2]Marco Ruffini, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Linda Doyle, David B. Payne:
Deployment Strategies for Protected Long-Reach PON. JOCN 4(2): 118-129 (2012) - [c19]Deepak Mehta, Barry O'Sullivan, Helmut Simonis:
Comparing Solution Methods for the Machine Reassignment Problem. CP 2012: 782-797 - [c18]Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
A Computational Geometry-Based Local Search Algorithm for Planar Location Problems. CPAIOR 2012: 97-112 - [c17]Marco Ruffini, Linda Doyle, David B. Payne, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
Deployment case studies of an energy efficient protected LR-PON architecture. ONDM 2012: 1-6 - 2011
- [c16]Deepak Mehta, Barry O'Sullivan, Luis Quesada:
Value Ordering for Finding All Solutions: Interactions with Adaptive Variable Ordering. CP 2011: 606-620 - [c15]Deepak Mehta, Barry O'Sullivan, Luis Quesada, Marco Ruffini, David B. Payne, Linda Doyle:
Designing Resilient Long-Reach Passive Optical Networks. IAAI 2011: 1674-1680 - [c14]Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Marco Ruffini, David B. Payne, Linda Doyle:
A Combinatorial Optimisation Approach to the Design of Dual Parented Long-Reach Passive Optical Networks. ICTAI 2011: 785-792 - [i1]Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Marco Ruffini, David B. Payne, Linda Doyle:
A Combinatorial Optimisation Approach to Designing Dual-Parented Long-Reach Passive Optical Networks. CoRR abs/1109.1231 (2011) - 2010
- [j1]David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson:
Developing Approaches for Solving a Telecommunications Feature Subscription Problem. J. Artif. Intell. Res. 38: 271-305 (2010) - [c13]Helmut Simonis, Paul Davern, Jacob Feldman, Deepak Mehta, Luis Quesada, Mats Carlsson:
A Generic Visualization Platform for CP. CP 2010: 460-474 - [c12]David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson:
Context-Sensitive Call Control Using Constraints and Rules. CP 2010: 583-597 - [c11]David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson:
Improving the Global Constraint SoftPrec. ECAI 2010: 1061-1062 - [c10]Deepak Mehta, Barry O'Sullivan, Luis Quesada:
Preferred Explanations for Quantified Constraint Satisfaction Problems. ICTAI (1) 2010: 275-278
2000 – 2009
- 2009
- [c9]Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson:
Search Space Extraction. CP 2009: 608-622 - [c8]David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson:
A Soft Global Precedence Constraint. IJCAI 2009: 566-571 - 2008
- [c7]David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson:
Personalisation of Telecommunications Services as Combinatorial Optimisation. AAAI 2008: 1693-1698 - [c6]David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson:
Solving a Telecommunications Feature Subscription Configuration Problem. CP 2008: 67-81 - [c5]Tarik Hadzic, David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson:
A BDD Approach to the Feature Subscription Problem. ECAI 2008: 698-702 - [c4]David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson:
Consistency Techniques for Finding an Optimal Relaxation of a Feature Subscription. ICTAI (1) 2008: 283-290 - 2007
- [c3]Deepak Mehta, Marc R. C. van Dongen:
Probabilistic Consistency Boosts MAC and SAC. IJCAI 2007: 143-148 - 2005
- [c2]Deepak Mehta, Marc R. C. van Dongen:
Probabilistic Arc Consistency. CP 2005: 862 - [c1]Deepak Mehta, Marc R. C. van Dongen:
Reducing Checks and Revisions in Coarse-grained MAC Algorithms. IJCAI 2005: 236-241
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-11-08 20:25 CET 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:
