48 results on '"Noémi Gaskó"'
Search Results
2. Heaviest and Densest Subgraph Computation for Binary Classification. A Case Study.
3. The Combined Critical Node and Edge Detection Problem. An Evolutionary Approach.
4. A New Type of Anomaly Detection Problem in Dynamic Graphs: An Ant Colony Optimization Approach.
5. An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem.
6. An Extremal Optimization Approach to the Pairwise Connectivity Critical Node Detection Problem.
7. Nested Markov chain hyper-heuristic (NMHH): a hybrid hyper-heuristic framework for single-objective continuous problems.
8. An Evolutionary Approach for Critical Node Detection in Hypergraphs. A Case Study of an Inflation Economic Network.
9. Critical Node Detection for Maximization of Connected Components: An Extremal Optimization Approach.
10. A Simple Genetic Algorithm for the Critical Node Detection Problem.
11. Identification of influential nodes with Shapley Influence Maximization Extremal Optimization algorithm.
12. Shapley Value and Extremal Optimization for the Network Influence Maximization Problem.
13. Influence Maximization and Extremal Optimization.
14. Pareto-based evolutionary multiobjective approaches and the generalized Nash equilibrium problem.
15. A Game Theoretical Analysis of Academic Writing Co-authorship Networks.
16. Feature Selection with a Genetic Algorithm for Classification of Brain Imaging Data.
17. Community structure detection in multipartite networks: a new fitness measure.
18. Computation of Berge-Zhukovskii Equilibrium in Discrete Time Dynamic Games.
19. About Nash Equilibrium, Modularity Optimization, and Network Community Structure Detection.
20. Dynamic Generalized Berge-Zhukovskii Equilibrium.
21. Exploring the Map Equation: Community Structure Detection in Unweighted, Undirected Networks.
22. A hypergraph model for representing scientific output.
23. Community Structure Detection for the Functional Connectivity Networks of the Brain.
24. Community Detection in Bipartite Networks Using a Noisy Extremal Optimization Algorithm.
25. Environment-Model Based Testing with Differential Evolution in an Industrial Setting.
26. Optimizing Test Input Generation for Reactive Systems with an Adaptive Differential Evolution.
27. Game theory, Extremal optimization, and Community Structure Detection in Complex Networks.
28. Approximation of (k, t)-robust Equilibria.
29. Noisy extremal optimization.
30. Scarce-resource capacity sharing in cognitive radio environments: a new game theoretical model.
31. Evolving Game Strategies in a Dynamic Cournot Oligopoly Setting.
32. Mixing Network Extremal Optimization for Community Structure Detection.
33. Approaching the bi-objective critical node detection problem with a smart initialization-based evolutionary algorithm.
34. A new network model for the study of scientific collaborations: Romanian computer science and mathematics co-authorship networks.
35. Multiobjective Evolution of Mixed Nash Equilibria.
36. Nash Equilibria Detection for Discrete-Time Generalized Cournot Dynamic Oligopolies.
37. Differential evolution for discrete-time large dynamic games.
38. A Game Theoretical Perspective on Small-Cell Open Capacity Sharing in Cognitive Radio Environments.
39. Between Selfishness and Altruism: Fuzzy Nash-Berge-Zhukovskii Equilibrium.
40. Cognitive radio simultaneous spectrum access/one-shot game modelling.
41. Detecting Strong Berge Pareto equilibrium in a non-cooperative game using an evolutionary approach.
42. Evolutionary Detection of Berge and Nash Equilibria.
43. Job Scheduling and Bin Packing from a Game Theoretical Perspective: An Evolutionary Approach.
44. Computing Strong Nash Equilibria for Multiplayer Games.
45. Characterization and Detection of epsilon-Berge Zhukovskii Equilibria.
46. Evolving mixed nash equilibria for bimatrix games.
47. Cognitive Radio Simultaneous Spectrum Access/ One-shot Game Modelling
48. Evolutionary detection of aumann equilibrium.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.