The following pages link to Marco Baioletti (Q421468):
Displaying 25 items.
- Experimental evaluation of pheromone models in ACOPlan (Q421472) (← links)
- Algorithms for possibility assessments: coherence and extension (Q533175) (← links)
- Exploiting independencies to compute semigraphoid and graphoid structures (Q541838) (← links)
- Inferential models and relevant algorithms in a possibilistic framework (Q541839) (← links)
- Acyclic directed graphs representing independence models (Q622277) (← links)
- Conditional independence structure and its closure: inferential rules and algorithms (Q962920) (← links)
- Simplification rules for the coherent probability assessment problem (Q1601897) (← links)
- Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs (Q1999003) (← links)
- An algebraic approach for the search space of permutations with repetition (Q2057112) (← links)
- A lattice-based representation of independence relations for efficient closure computation (Q2206476) (← links)
- A novel ant colony optimization strategy for the quantum circuit compilation problem (Q2233514) (← links)
- Finding P–Maps and I–Maps to Represent Conditional Independencies (Q3011949) (← links)
- Weighted Attribute Combinations Based Similarity Measures (Q3143400) (← links)
- An Algorithm to Find a Perfect Map for Graphoid Structures (Q3163962) (← links)
- Acyclic Directed Graphs to Represent Conditional Independence Models (Q3638176) (← links)
- Solving permutation flowshop scheduling problems with a discrete differential evolution algorithm (Q4592699) (← links)
- An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems (Q5140142) (← links)
- Tackling Permutation-based Optimization Problems with an Algebraic Particle Swarm Optimization Algorithm (Q5223210) (← links)
- MOEA/DEP: An Algebraic Decomposition-Based Evolutionary Algorithm for the Multiobjective Permutation Flowshop Scheduling Problem (Q5233124) (← links)
- Qualitative Combination of Independence Models (Q5326408) (← links)
- AI*IA 2003: Advances in Artificial Intelligence (Q5897334) (← links)
- A binary algebraic differential evolution for the multidimensional two-way number partitioning problem (Q6084514) (← links)
- A further step for efficient corrections of inconsistent probabilistic data sets (Q6116537) (← links)
- A L1 Minimization Optimal Corrective Explanation Procedure for Probabilistic Databases (Q6485304) (← links)
- A performance analysis of Basin Hopping compared to established metaheuristics for global optimization (Q6568957) (← links)
