The following pages link to Mario Ventresca (Q336924):
Displaying 14 items.
- A derandomized approximation algorithm for the critical node detection problem (Q336925) (← links)
- A randomized algorithm with local search for containment of pandemic disease spread (Q337036) (← links)
- Local search genetic algorithms for the job shop scheduling problem (Q702800) (← links)
- A diversity maintaining population-based incremental learning algorithm (Q955716) (← links)
- The bi-objective critical node detection problem (Q1681144) (← links)
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem (Q1761226) (← links)
- A Region Growing Algorithm for Detecting Critical Nodes (Q2942434) (← links)
- A Fast Greedy Algorithm for the Critical Node Detection Problem (Q2942435) (← links)
- The Use of Opposition for Decreasing Function Evaluations in Population-Based Search (Q4929777) (← links)
- Supervised Link Weight Prediction Using Node Metadata (Q5050364) (← links)
- An Ant Colony Approach for the Winner Determination Problem (Q5233126) (← links)
- Opposition-Based Computing (Q5302471) (← links)
- Two Frameworks for Improving Gradient-Based Learning Algorithms (Q5302484) (← links)
- (Q5379116) (← links)
