The following pages link to Maria J. Blesa (Q313964):
Displaying 17 items.
- Celebrity games (Q313966) (← links)
- (Q650923) (redirect page) (← links)
- The robustness of stability under link and node failures (Q650924) (← links)
- Maria Serna's contributions to adversarial queuing theory (Q826320) (← links)
- Beam search for the longest common subsequence problem (Q833536) (← links)
- New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem (Q1764754) (← links)
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm (Q2466394) (← links)
- An ant colony optimization algorithm for DNA sequencing by hybridization (Q2483507) (← links)
- Firefighting as a Game (Q2945277) (← links)
- Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? (Q3304189) (← links)
- A Characterization of Universal Stability in the Adversarial Queuing Model (Q4651525) (← links)
- (Q4737359) (← links)
- Distributed Computing (Q5395161) (← links)
- Probabilistic Beam Search for the Longest Common Subsequence Problem (Q5429296) (← links)
- Firefighting as a Strategic Game (Q5856433) (← links)
- Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem (Q6483593) (← links)
- Beam-ACO for the Repetition-Free Longest Common Subsequence Problem (Q6487177) (← links)
