Pages that link to "Item:Q276517"

The following pages link to Annals of Mathematics and Artificial Intelligence (Q276517):

Displaying 50 items.

• Guest editorial: Revised selected papers from the LION 8 conference (Q276518) (← links)
• Controlling selection areas of useful infeasible solutions for directed mating in evolutionary constrained multi-objective optimization (Q276522) (← links)
• On some statistical procedures for stock selection problem (Q276526) (← links)
• On multivariate network analysis of statistical data sets with different measures of association (Q276528) (← links)
• Models and algorithms for competitive facility location problems with different customer behavior (Q276530) (← links)
• A hybrid clonal selection algorithm for the location routing problem with stochastic demands (Q276534) (← links)
• Algorithm portfolios for noisy optimization (Q276539) (← links)
• POPMUSIC as a matheuristic for the berth allocation problem (Q276540) (← links)
• GeneRa: a problem generator for radiotherapy treatment scheduling problems (Q276543) (← links)
• Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types (Q276548) (← links)
• Portfolio approaches for constraint optimization problems (Q276552) (← links)
• Implication and axiomatization of functional and constant constraints (Q287754) (← links)
• Constraint-preserving snapshot isolation (Q287756) (← links)
• Efficient editing and data abstraction by finding homogeneous clusters (Q287759) (← links)
• Structures of opposition induced by relations. The Boolean and the gradual cases (Q287761) (← links)
• A quantitative approach to belief revision in structured probabilistic argumentation (Q287765) (← links)
• Guest editorial: revised selected papers from the AMAI 2014 special track on computational social choice (Q314416) (← links)
• Manipulation complexity of same-system runoff elections (Q314418) (← links)
• Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control (Q314421) (← links)
• The complexity of priced control in elections (Q314424) (← links)
• On the hardness of bribery variants in voting with CP-nets (Q314427) (← links)
• A Borda count for collective sentiment analysis (Q314431) (← links)
• Matching couples with Scarf's algorithm (Q314433) (← links)
• Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games (Q314437) (← links)
• Computational social choice for coordination in agent networks (Q314440) (← links)
• Preferences in artificial intelligence (Q314443) (← links)
• Special issue on multi-agent systems (Q314469) (← links)
• Synthesis with rational environments (Q314471) (← links)
• Distributed coordination of emergency medical service for angioplasty patients (Q314475) (← links)
• Interchangeability with thresholds and degradation factors for soft CSPs (Q353304) (← links)
• Recursive decomposition and bounds of the lattice of Moore co-families. (Q353309) (← links)
• Modularity-based decompositions for valued CSP (Q353312) (← links)
• A continuous analog for 4-dimensional objects (Q354604) (← links)
• Spatial reasoning with rectangular cardinal relations. The convex tractable subalgebra (Q354605) (← links)
• Relational concept analysis: mining concept lattices from multi-relational data (Q354609) (← links)
• Proof systems and transformation games (Q354613) (← links)
• Invariants for homology classes with application to optimal search and planning problem in robotics (Q360246) (← links)
• Toward incremental computation of argumentation semantics: a decomposition-based approach (Q360248) (← links)
• Representing and solving finite-domain constraint problems using systems of polynomials (Q360253) (← links)
• A framework for modular ERDF ontologies (Q360258) (← links)
• Planning for multiple measurement channels in a continuous-state POMDP (Q360261) (← links)
• Special issue: Foundations of information and knowledge systems. Selected papers based on the presentations at the 5th international symposium (FoIKS 2008), Pisa, Italy, February 11--15, 2008. (Q408498) (← links)
• Discovering the suitability of optimisation algorithms by learning from evolved instances (Q408979) (← links)
• Improving the anytime behavior of two-phase local search (Q408982) (← links)
• Feature extraction from optimization samples via ensemble based symbolic regression (Q408986) (← links)
• Algorithm portfolio selection as a bandit problem with unbounded losses (Q408989) (← links)
• \textsc{NeVer}: a tool for artificial neural networks verification (Q421446) (← links)
• Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis (Q421447) (← links)
• Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
• Computing weighted solutions in ASP: representation-based method vs. search-based method (Q421455) (← links)