default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMario Ventresca
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Faraz Khoshbakhtian, Hamidreza Validi
, Mario Ventresca, Dionne M. Aleman:
Optimal design of vaccination policies: A case study for Newfoundland and Labrador. Oper. Res. Lett. 55: 107140 (2024)- 2022
- [j29]Viplove Arora, Enrico Amico, Joaquín Goñi, Mario Ventresca:
Investigating cognitive ability using action-based models of structural brain networks. J. Complex Networks 10(4) (2022) - [j28]Larissa Mori, Kaleigh O'Hara, Toyya A. Pujol, Mario Ventresca:
Examining Supervised Machine Learning Methods for Integer Link Weight Prediction Using Node Metadata. Entropy 24(6): 842 (2022) - [j27]Michael J. Garee, Hong Wan, Mario Ventresca:
Social Influence Network Simulation Design Affects Behavior of Aggregated Entropy. IEEE Trans. Comput. Soc. Syst. 9(2): 594-604 (2022) - [c27]John MaGee, Viplove Arora, Mario Ventresca:
Identifying the source of an epidemic using particle swarm optimization. GECCO 2022: 1237-1244 - 2021
- [j26]Kausar Abbas, Mintao Liu, Manasij Venkatesh, Enrico Amico, Alan David Kaplan, Mario Ventresca, Luiz Pessoa, Jaroslaw Harezlak, Joaquín Goñi:
Geodesic Distance on Optimally Regularized Functional Connectomes Uncovers Individual Fingerprints. Brain Connect. 11(5): 333-348 (2021) - [j25]Abhishek Ray, Mario Ventresca, Karthik N. Kannan:
A Graph-Based Ant Algorithm for the Winner Determination Problem in Combinatorial Auctions. Inf. Syst. Res. 32(4): 1099-1114 (2021) - [c26]Larissa Mori, Mario Ventresca, Toyya A. Pujol:
Supervised Link Weight Prediction Using Node Metadata. COMPLEX NETWORKS 2021: 496-507 - 2020
- [j24]Dawei Wang, Yuehwern Yih, Mario Ventresca:
Improving neighbor-based collaborative filtering by using a hybrid similarity measurement. Expert Syst. Appl. 160: 113651 (2020) - [j23]Viplove Arora, Dali Guo, Katherine D. Dunbar, Mario Ventresca:
Examining the variability in network populations and its role in generative models. Netw. Sci. 8(S1): S43-S64 (2020) - [j22]Uttara Tipnis, Enrico Amico, Mario Ventresca, Joaquín Goñi:
Modeling Communication Processes in the Human Connectome through Cooperative Learning. IEEE Trans. Netw. Sci. Eng. 7(1): 476-488 (2020)
2010 – 2019
- 2019
- [j21]Patchara Kitjacharoenchai, Mario Ventresca, Mohammad Moshref-Javadi, Seokcheon Lee, Jose M. A. Tanchoco, Patrick A. Brunese:
Multiple traveling salesman problem with drones: Mathematical model and heuristic approach. Comput. Ind. Eng. 129: 14-30 (2019) - [j20]Ahmad Altarabsheh, Amr Kandil, Dulcy M. Abraham, Daniel DeLaurentis, Mario Ventresca:
System of Systems Approach for Maintaining Wastewater System. J. Comput. Civ. Eng. 33(3) (2019) - 2018
- [j19]Viplove Arora, Mario Ventresca:
Modeling topologically resilient supply chain networks. Appl. Netw. Sci. 3(1): 19:1-19:20 (2018) - [j18]Mario Ventresca, Kyle Robert Harrison, Beatrice M. Ombuki-Berman:
The bi-objective critical node detection problem. Eur. J. Oper. Res. 265(3): 895-908 (2018) - [j17]Ahmad Altarabsheh, Amr Kandil, Mario Ventresca:
New Multiobjective Optimization Approach to Rehabilitate and Maintain Sewer Networks Based on Whole Lifecycle Behavior. J. Comput. Civ. Eng. 32(1) (2018) - [j16]Ahmad Altarabsheh, Mario Ventresca, Amr Kandil:
New Approach for Critical Pipe Prioritization in Wastewater Asset Management Planning. J. Comput. Civ. Eng. 32(5) (2018) - [j15]Ahmad Altarabsheh, Mario Ventresca, Amr Kandil:
Evolutionary Algorithm for Selecting Wastewater System Configuration. J. Comput. Civ. Eng. 32(6) (2018) - [c25]Mario Ventresca:
Using Algorithmic Complexity to Differentiate Cognitive States in fMRI. COMPLEX NETWORKS (2) 2018: 663-674 - [c24]Viplove Arora, Mario Ventresca:
Evaluating the Natural Variability in Generative Models for Complex Networks. COMPLEX NETWORKS (1) 2018: 743-754 - [c23]Abhishek Ray, Mario Ventresca:
An Ant Colony Approach for the Winner Determination Problem. EvoCOP 2018: 174-188 - [c22]Abhishek Ray, Mario Ventresca, Hong Wan:
A Mechanism Design Approach to Blockchain Protocols. iThings/GreenCom/CPSCom/SmartData 2018: 1603-1608 - 2017
- [c21]Viplove Arora, Mario Ventresca:
Action-Based Model for Topologically Resilient Supply Networks. COMPLEX NETWORKS 2017: 658-669 - [c20]Bryan H. Chong, Mario Ventresca:
Attacking Unexplored Networks - The Probe-and-Attack Problem. COMPLEX NETWORKS 2017: 692-703 - [c19]Dali Guo, Viplove Arora, Enrico Amico, Joaquín Goñi, Mario Ventresca:
Dynamic Generative Model of the Human Brain in Resting-State. COMPLEX NETWORKS 2017: 1271-1283 - 2016
- [j14]Kyle Robert Harrison, Mario Ventresca, Beatrice M. Ombuki-Berman:
A meta-analysis of centrality measures for comparing and generating complex network models. J. Comput. Sci. 17: 205-215 (2016) - [c18]Viplove Arora, Mario Ventresca:
A Multi-objective Optimization Approach for Generating Complex Networks. GECCO (Companion) 2016: 15-16 - 2015
- [j13]Mario Ventresca, Dionne M. Aleman:
Network robustness versus multi-strategy sequential attack. J. Complex Networks 3(1): 126-146 (2015) - [c17]Mario Ventresca, Kyle Robert Harrison, Beatrice M. Ombuki-Berman:
An Experimental Evaluation of Multi-objective Evolutionary Algorithms for Detecting Critical Nodes in Complex Networks. EvoApplications 2015: 164-176 - [c16]Kyle Robert Harrison, Mario Ventresca, Beatrice M. Ombuki-Berman:
Investigating Fitness Measures for the Automatic Construction of Graph Models. EvoApplications 2015: 189-200 - 2014
- [j12]Mario Ventresca, Dionne M. Aleman:
A derandomized approximation algorithm for the critical node detection problem. Comput. Oper. Res. 43: 261-270 (2014) - [j11]Mario Ventresca, Dionne M. Aleman:
A randomized algorithm with local search for containment of pandemic disease spread. Comput. Oper. Res. 48: 11-19 (2014) - [j10]Alexander Bailey, Mario Ventresca, Beatrice M. Ombuki-Berman:
Genetic Programming for the Automatic Inference of Graph Models for Complex Networks. IEEE Trans. Evol. Comput. 18(3): 405-419 (2014) - [c15]Mario Ventresca, Dionne M. Aleman:
A Region Growing Algorithm for Detecting Critical Nodes. COCOA 2014: 593-602 - [c14]Mario Ventresca, Dionne M. Aleman:
A Fast Greedy Algorithm for the Critical Node Detection Problem. COCOA 2014: 603-612 - [p4]Mario Ventresca, Dionne M. Aleman:
Approximation Algorithms for Detecting Critical Nodes. Examining Robustness and Vulnerability of Networked Systems 2014: 289-305 - 2013
- [j9]Mario Ventresca, Dionne M. Aleman:
Evaluation of strategies to mitigate contagion spread using social network characteristics. Soc. Networks 35(1): 75-88 (2013) - [c13]Mario Ventresca, Beatrice M. Ombuki-Berman, Andrew Runka:
Predicting Genetic Algorithm Performance on the Vehicle Routing Problem Using Information Theoretic Landscape Measures. EvoCOP 2013: 214-225 - [c12]Alexander Bailey, Beatrice M. Ombuki-Berman, Mario Ventresca:
Automatic inference of hierarchical graph models using genetic programming with an application to cortical networks. GECCO 2013: 893-900 - 2012
- [j8]Shahryar Rahnamayan, G. Gary Wang, Mario Ventresca:
An intuitive distance-based explanation of opposition-based sampling. Appl. Soft Comput. 12(9): 2828-2839 (2012) - [j7]Mario Ventresca:
Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem. Comput. Oper. Res. 39(11): 2763-2775 (2012) - [c11]Alexander Bailey, Mario Ventresca, Beatrice M. Ombuki-Berman:
Automatic generation of graph models for complex networks by genetic programming. GECCO 2012: 711-718 - 2011
- [j6]Hui Wang, Zhijian Wu, Shahryar Rahnamayan, Yong Liu, Mario Ventresca:
Enhancing particle swarm optimization using generalized opposition-based learning. Inf. Sci. 181(20): 4699-4714 (2011) - 2010
- [j5]Mario Ventresca, Shahryar Rahnamayan, Hamid R. Tizhoosh:
A note on "Opposition versus randomness in soft computing techniques" [Appl. Soft Comput 8 (2) (2008) 906-918]. Appl. Soft Comput. 10(3): 956-957 (2010)
2000 – 2009
- 2009
- [b1]Mario Ventresca:
Symmetry Induction in Computational Intelligence. University of Waterloo, Ontario, Canada, 2009 - [c10]Andrew Runka, Beatrice M. Ombuki-Berman, Mario Ventresca:
A search space analysis for the waste collection vehicle routing problem with time windows. GECCO 2009: 1813-1814 - [c9]Mario Ventresca, Hamid R. Tizhoosh:
Improving gradient-based learning algorithms for large scale feedforward networks. IJCNN 2009: 3212-3219 - 2008
- [j4]Mario Ventresca, Hamid R. Tizhoosh:
A diversity maintaining population-based incremental learning algorithm. Inf. Sci. 178(21): 4038-4056 (2008) - [c8]Mario Ventresca, Hamid R. Tizhoosh:
Numerical condition of feedforward networks with opposite transfer functions. IJCNN 2008: 3233-3240 - [p3]Hamid R. Tizhoosh, Mario Ventresca:
Introduction. Oppositional Concepts in Computational Intelligence 2008: 1-8 - [p2]Hamid R. Tizhoosh, Mario Ventresca, Shahryar Rahnamayan:
Opposition-Based Computing. Oppositional Concepts in Computational Intelligence 2008: 11-28 - [p1]Mario Ventresca, Hamid R. Tizhoosh:
Two Frameworks for Improving Gradient-Based Learning Algorithms. Oppositional Concepts in Computational Intelligence 2008: 255-284 - [e1]Hamid R. Tizhoosh, Mario Ventresca:
Oppositional Concepts in Computational Intelligence. Studies in Computational Intelligence 155, Springer 2008, ISBN 978-3-540-70826-1 [contents] - 2007
- [c7]Mario Ventresca, Hamid R. Tizhoosh:
Simulated Annealing with Opposite Neighbors. FOCI 2007: 186-192 - [c6]Beatrice M. Ombuki-Berman, Mario Ventresca:
Search Difficulty of Two-Connected Ring-based Topological Network Designs. FOCI 2007: 267-274 - [c5]Mario Ventresca, Hamid R. Tizhoosh:
Opposite Transfer Functions and Backpropagation Through Time. FOCI 2007: 570-577 - [c4]Mario Ventresca, Beatrice M. Ombuki-Berman:
Epistasis in Multi-Objective Evolutionary Recurrent Neuro-Controllers. ALIFE 2007: 77-84 - 2006
- [j3]Gary Gréwal, Stelian Coros, Mario Ventresca:
A Memetic Algorithm for Performing Memory Assignment in Dual-Bank DSPs. Int. J. Comput. Intell. Appl. 6(4): 473-497 (2006) - [c3]Gary Gréwal, Stelian Coros, Dilip K. Banerji, Andrew Morton, Mario Ventresca:
Optimized Memory Assignment for DSPs. IEEE Congress on Evolutionary Computation 2006: 64-72 - [c2]Mario Ventresca, Beatrice M. Ombuki-Berman:
Search Space Analysis of Recurrent Spiking and Continuous-time Neural Networks. IJCNN 2006: 4514-4521 - [c1]Mario Ventresca, Hamid R. Tizhoosh:
Improving the Convergence of Backpropagation by Opposite Transfer Functions. IJCNN 2006: 4777-4784 - 2005
- [j2]Mario Ventresca, Beatrice M. Ombuki:
A Genetic Algorithm for the Design of Minimum-cost Two-connected Networks with Bounded Rings. Int. J. Comput. Intell. Appl. 5(2): 267-281 (2005) - 2004
- [j1]Beatrice M. Ombuki, Mario Ventresca:
Local Search Genetic Algorithms for the Job Shop Scheduling Problem. Appl. Intell. 21(1): 99-109 (2004)
Coauthor Index
aka: Beatrice M. Ombuki
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-08-23 18:33 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:
