Export 2134 results:
[ Autor(Asc)] Título Tipo Año
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
M
Marés J, Torra V.  2012.  Clustering-Based Categorical Data Protection. Privacy in Statistical Databases. 7556:78-89.
Marés J, Torra V.  2013.  On the Protection of Social Network-Extracted Categorical Microdata. Citizen in Sensor Networks. LNCS 7685:33-42.
Marés J, Torra V.  2012.  An Evolutionary Optimization Approach for Categorical Data Protection. Privacy and Anonymity in the Information Society 2012.
Marchioni E, Montagna F.  2007.  Complexity and definability issues in LPi1/2. Journal of Logic and Computation. 17:21.
Marchioni E.  2008.  On computational complexity of semilinear varieties. Journal of Logic and Computation. 18:18.
Marchioni E.  2008.  Representing upper probability measures over Rational Lukasiewicz Logic. Mathware & Soft Computing. 15:14.
Marchioni E, Montagna F.  2008.  On triangular norms and uninorms definable in LPi1/2. International Journal of Approximate Reasoning. 47:22.
Marchioni E, Godo L.  2004.  A logic for reasoning about coherent conditional probability: a modal fuzzy logic approach. 9th European Conference on Logics in Artificial Intelligence, JELIA 2004. 3229:213-225.
Marchioni E.  2008.  On computational complexity of semilinear varietes. Journal of Logic and Computation. 18:18.
Marchioni E.  2009.  Ordered fields and LPi1/2 algebras. Soft Computing - A Fusion of Foundations, Methodologies and Applications. 13:5.
Manzano S, Ontañón S, Plaza E.  2011.  Amalgam-based Reuse for Multiagent Case-based Reasoning. Case-Based Reasoning Research and Development: 19th International Conference on Case-Based Reasoning (ICCBR'11). 6880:122-136.
Manzano S, Ontañón S, Plaza E.  2011.  A Case-based Approach to Open-Ended Collective Agreement with Rational Ignorance. Case-Based Reasoning Research and Development: 19th International Conference on Case-Based Reasoning (ICCBR'11). 6880:107-121.
Manyà F, Negrete S, Roig C, Soler JRamon.  2017.  A MaxSAT-Based Approach to the Team Composition Problem in a Classroom. FIRST INTERNATIONAL WORKSHOP ON TEAMS IN MULTIAGENT SYSTEMS. :82-89.
Macho-González S, Meseguer P.  2005.  Open, interactive and dynamic CSP. Changes'05 International Workshop on Constraint Solving under Change and Uncertainty. :13-17.
Macho-González S, Ansótegui C, Meseguer P.  2006.  Boosting Open CSPs. Lecture Notes in Computer Science. 4204:314-328.
Macho-González S, Meseguer P.  2007.  Boosting MUS Extraction. LNAI. 4612:285-299.
Macarthur K, Vinyals M, Farinelli A, Ramchurn SD, Jennings NR.  2011.  Decentralised Parallel Machine Scheduling for Multi-Agent Task Allocation. Proceedings of the 4th International Workshop on Optimization in Multi-Agent Systems Agents@AAMAS (OPTMAS 2011).
Ma J, Liu W, Godo L, Sierra C.  2014.  Plan Selection for Probabilistic BDI Agents. 26th IEEE International Conference on Tools with Artificial Intelligence. :83-90.
L
López-Sánchez M, de Mántaras RLópez, Sierra C.  2001.  Map generation by co-operative autonomous robots using possibility theory. STUDIES IN FUZZINESS AND SOFT COMPUTING: Fuzzy Logic Techniques for Autonomous Vehicle Navigation.. :281-312.
López-Sánchez M, Serramia M, Rodríguez-Aguilar JA, Morales J, Wooldridge M, Ansótegui C.  2018.  Exploiting moral values to choose the right norms. AAAI/ACM Conference on Artificial Intelligence, Ethics and Society.
López-Sánchez M, de Mántaras RLópez, Sierra C.  1999.  Map Generation by means of autonomous robots and possibility propagation techniques. Third International conference on Autonomous Agents. :380-381.
López-Sánchez M, de Mántaras RLópez, Sierra C.  1998.  Possibility theory-based environment modelling by means of behaviour-based autonomous robots. European Conference on Artificial Intelligence. ECAI 98. :222-229.
López-Sánchez M, Noria X, Rodríguez-Aguilar JA, Gilbert N.  2005.  Multiagent based simulation on news digital markets. International journal of computer science and applications.. 2:7-14.
López-Sánchez M, de Mántaras RLópez, Sierra C.  1999.  Generation and Extension of Maps obtained by autonomous robots. EUSFLAT'99. :295-298.
López-Sánchez M, Serramia M, Rodríguez-Aguilar JA, Morales J, Wooldridge M.  2017.  Automating decision making to help establish norm-based regulations. Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems. :1613-1615.
López-Sánchez M, Noria X, Rodríguez-Aguilar JA, Gilbert N, Schuster S.  2004.  Simulation of digital content distribution using a multi-agent simulation approach. Recent Advances in Artificial Intelligence Research and Development. :341-348.
López-Sánchez M, Escobar P, Serramia M, Rodríguez-Aguilar JA.  2019.  Democràcia, participació ciutadana i Intel·ligència Artificial. Nodes. (58)
López-Sánchez M, de Mántaras RLópez, Sierra C.  1997.  Incremental map generation by low cost robots based on possibility/necessity grids. 13th Conference on uncertainty in AI. :351-357.
López-Sánchez M, Serramia M, Rodríguez-Aguilar JA, Morales J, Wooldridge M.  2017.  Automating decision making to help establish norm-based regulations. CoRR. abs/1703.09087
López B, Plaza E.  1997.  Case-based learning of plans and goal states in medical diagnosis. Artificial Intelligence in Medicine. 9:29-60.
López B, Plaza E.  1991.  Case-based Learning on Strategic Knowledge. Lecture Notes in Artificial Intelligence. 482:398-411.
López B, Meseguer P, Plaza E.  1990.  Knowledge -Based Systems Validation: A State of the Art. AI Communications. 3:58-72.
Lizárraga E, Blesa MJ, Blum C.  2017.  On the comparison of CMSA versus LNS for solving Combinatorial Optimization problems with different solution sizes. Metaheuristics International Conference (MIC). :676-678.
Lizárraga E, Blesa MJ, Blum C, Raidl GR.  2017.  Large neighborhood search for the most strings with few bad columns problem. Soft Computing. 21(17):4901–4915.
Lizárraga E, Blesa MJ, Blum C.  2017.  Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? EvoCOP 2017 -- 17th European Conference on Evolutionary Computation in Combinatorial Optimization. 10197 (Lecture Notes in Computer Science):60--74.
Li CMin, Manyà F, Quan Z, Zhu Z.  2010.  Exact MinSAT Solving. International Conference on Theory and Applications of Satisfiability Testing (SAT). 6175:363-368.
Li CMin, Manyà F, Planes J.  2007.  New Inference Rules for Max-SAT. Journal of Artificial Intelligence Research. 30:321-359.
Li CMin, Manyà F, Mohamedou NOuld, Planes J.  2010.  Resolution-Based Lower Bounds in MaxSAT. Constraints. 15:29.
Li CMin, Zhu Z, Manyà F, Simon L.  2012.  Optimizing with minimum satisfiability. Artificial intelligence. 190:32-44.
Li CMin, Manyà F, Planes J..  2006.  Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT. Proceedings of the 21st National Conference on Artificial Intelligence, AAAI-2006, Boston/MA, USA. :86-91.
Li CMin, Manyà F, Mohamedou NOuld, Planes J.  2009.  Exploiting Cycle Structures in Max-SAT. 12th International Conference on Theory and Applications of Satisfiability Testing (SAT 2009). 5584:467-480.
Li CMin, Manyà F, Mohamedou NO, Planes J.  2008.  Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation. 14th International Conference on Principles and Practice of Constraint Programming (CP-2008). 5202:582-587.
Li CMin, Manyà F, Planes J..  2005.  Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max SAT Solvers. Lecture Notes in Computer Science. 3571:403-414.
Li CMin, Manyà F.  2009.  MaxSAT, Hard and Soft Constraints. Handbook of Satisfiability. 185:613-631.
Li CMin, Zhu Z, Manyà F, Simon L.  2011.  Minimum Satisfiability and Its Applications. 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011. :605-610.
Levy J, Schmidt-Schauss M, Villaret M.  2004.  Monadic Second-Order Unifications is NP Complete. Lecture Notes in Computer Science. 3091:55-69.
Levy J, Schmidt-Schauss M, Villaret M.  2006.  Stratified Context Unification is NP-complete. Lecture Notes in Computer Science. 4130:82-96.
Levy J.  1996.  Linear Second Order Unification. Lecture Notes in Computer Science. 1103:332-346.
Levy J, Veanes M.  2000.  On the Undecidability of Second-Order Unification. Information and Computation. 159:125–150.
Levy J, Schmidt-Schauss M, Villaret M.  2006.  Bounded Second-Order Unification Is NP-Complete. Lecture Notes in Computer Science. 4098:400-414.