RCRA 2012 Post-proceedings with a selection of extended versions of the best papers will appear as a special issue of AI Communications (IOS Press).
RCRA 2011
RCRA 2010Proceedings appear as Volume 616 of CEUR Workshop Proceedings. Post-proceedings with a selection of extended versions of the best papers are published in Annals of Mathematics and Artificial Intelligence (AMAI), Volume 62, Number 3--4, 2011. - Marco Gavanelli, Toni Mancini
17th RCRA international workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”. Preface - Marco Alberti, Pierangelo Dell’Acqua and Luís Moniz Pereira
Observation strategies for event detection with incidence on runtime verification: theory, algorithms, experimentation - Marco Baioletti, Alfredo Milani, Valentina Poggioni and Fabio Rossi
Experimental evaluation of pheromone models in ACOPlan - Duygu Cakmak, Esra Erdem and Halit Erdogan
Computing weighted solutions in ASP: representation-based method vs. search-based method - Alfonso E. Gerevini, Alessandro Saetti and Ivan Serina
Planning in domains with derived predicates through rule-action graphs and local search - Daniel Guimarans, Rosa Herrero, Daniel Riera, Angel A. Juan and Juan José Ramos
Combining probabilistic algorithms, Constraint Programming and Lagrangian Relaxation to solve the Vehicle Routing Problem - Joao Marques-Silva, Josep Argelich, Ana Graça and Inês Lynce
Boolean lexicographic optimization: algorithms & applications - Alessandra Mileo, Torsten Schaub, Davide Merico and Roberto Bisiani
Knowledge-based multi-criteria optimization to support indoor positioning - Angelo Oddi, Riccardo Rasconi, Amedeo Cesta and Stephen F. Smith
Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis - Luca Pulina and Armando Tacchella
NeVer: a tool for artificial neural networks verification
RCRA 2009
Proceedings appear as Volume 589 of CEUR
Workshop Proceedings.
- Marco Gavanelli, Toni Mancini, Alberto Pettorossi
RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion. Preface
- Amedeo Cesta, Simone Fratini, Andrea Orlandini, Alberto Finzi, Enrico Tronci
Flexible Plan Verification: Feasibility Results - Matthew Lewis, Tobias Schubert, and Bernd Becker, Paolo Marin, Massimo Narizzano, Enrico Giunchiglia
Parallel QBF Solving with Advanced Knowledge Sharing - Alfonso Gerevini, Alessandro Saetti, Ivan Serina
An Empirical Analysis of Some Heuristic Features for Planning through Local Search and Action Graphs - Fabio Massimo Zanzotto, Lorenzo Dell'Arciprete, Alessandro Moschitti
Efficient Graph Kernels for Textual Entailment Recognition - Jun He, Pierre Flener, Justin Pearson
An automaton Constraint for Local Search - Inês Lynce, Joao Marques-Silva
Restoring CSP Satisfiability with MaxSAT - Michele Lombardi, Michela Milano, Andrea Roli, Alessandro Zanarini
Deriving Information from Sampling and Diving - Antti E. J. Hyvärinen, Tommi Junttila, Ilkka Niemelä
Partitioning Search Spaces of a Randomized Search
RCRA 2008
Proceedings appear as Volume 451 of CEUR Workshop Proceedings.
Post-proceedings with a selection of extended versions of the best papers are published in Fundamenta Informaticae, Volume 102, Number 3-4, 2010.
- Marco Gavanelli, Toni Mancini
RCRA 2008 - Experimental Evaluation of Algorithms for Solving Problems
with Combinatorial Explosion. Preface.
- Thanasis Balafoutis, Kostas Stergiou
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
- Ismel Brito, Pedro Meseguer
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
- Alfonso E. Gerevini, Ivan Serina
Efficient Plan Adaptation through Replanning Windows
and Heuristic Goals
- Marco Montali,Paolo Torroni, Federico Chesani, Paola Mello, Marco Alberti, Evelina
Lamma
Abductive Logic Programming as an Effective Technology for the Static Verification of Declarative Business Processes
- António Morgado, Joao Marques-Silva
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
- Luca Pulina, Armando Tacchella
An Empirical Study of QBF Encodings:
from Treewidth Estimation to Useful Preprocessing
- Fabrizio Riguzzi
SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions
- Takehide Soh,Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara, Hidetomo
Nabeshima
A SAT-based Method for Solving the Two-dimensional Strip Packing
Problem
RCRA 2007
Special issue of the Journal of Algorithms in Cognition, Informatics and Logic (Elsevier) Volume 63, Issues 1-3, January-July 2008.
- Marco Gavanelli, Toni Mancini
RCRA 2007: Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
- Joao Marques-Silva
Model Checking with Boolean Satisfiability
- Gilles Audemard, Said Jabbour, Lakhdar Sais
SAT Graph-Based Representation: A New Perspective
- F. Calimeri, S. Perri, F. Ricca
Experimenting with Parallelism for the Instantiation of ASP Programs
- Luca Di Gaspero, Andrea Roli
Stochastic local search for large-scale instances of the Haplotype Inference Problem by Parsimony
- Marco Maratea, Francesco Ricca, Wolfgang Faber, Nicola Leone
Look-Back Techniques and Heuristics in DLV: Implementation, Evaluation, and Comparison to QBF Solvers
- Matti Järvisalo, Ilkka Niemelä
The Effect of Structural Branching on the Efficiency of Clause Learning SAT Solving: An Experimental Study
- Richard J. Wallace, Diarmuid Grimes
Experimental Studies of Variable Selection Strategies Based on Constraint Weights
- Meritxell Vinyals, Andrea Giovannucci, Jesús Cerquides, Pedro Meseguer, Juan A. Rodriguez-Aguilar
A Test Suite for the Evaluation of Mixed Multi-Unit Combinatorial Auctions
RCRA 2005
Special issue of Intelligenza Artificiale Anno II, Numero 3
Contributi scientifici
- Nota dei curatori: M. Cadoli, M. Gavanelli, T. Mancini
RCRA 05: giornata di lavoro su analisi sperimentale e benchmark di algoritmi per l'intelligenza artificiale
- Valutazione di efficienza ed eseguibilità dell'allocazione e scheduling in un multi-processor systems-on-chip
L. Benini, D. Bertozzi, A. Guerri, M. Milano, F. Poletti
- Valutazione di problemi ardui per il secondo livello della gerarchia polinomiale: euristiche ed esperimenti
W. Faber, N. Leone, F. Ricca
- Studio di un generatore di istanze per reactive scheduling
N. Policella, R. Rasconi
- Procedure di decisione ibride per QBF
M. Benedetti
- Il comportamento computazionale della procedura abduttiva SCIFF e del sistema SOCS-SI
M. Alberti, F. Chesani
- Un confronto di sistemi di ILP sul dataset Sisyphus
F. Riguzzi
RCRA 1999
Special issue of AI*IA Notizie, Number 1, Volume 13, March 2000
- M. Cadoli
Analisi Sperimentale di Algoritmi per l'Intelligenza Artificiale
- C. Mannino, A. Sassano
Augmentation, Local Search and Learning
- I. Horrocks
Testing Optimisations with Realistic Data
- A. Cesta, A. Oddi, A. Susi
A Tool for Generating Random Temporal Networks
- P. Liberatore
Algorithms and Experiments on Finding Minimal Models
- M. Cadoli, M. Giovanardi, M. Schaerf
Evaluation of Quantified Boolean Formulae on
 -
and PSPACE-complete instances
- A. Formisano, E. G. Omodeo
Initial experiments in equational set reasoning
- A. Gerevini, I. Serina
Pianificazione Efficiente attraverso Grafi di Azioni
- M. Milano, A. Roli
Boolean Networks-based Algorithms for the Satisfiability Problem
- M. Gavanelli, E. Lamma, P.Mello, M. Milano
Performance Measurement of Interactive CSP Search Algorithms
- M. Balduccini, G. Brignoli, G.A. Lanzarone, F. Magni, A. Provetti
Experiments in Answer Sets Planning
- F. Massacci
Competitive analysis is not so simple:
the organization on the TANCS Modal and Description Logics Competition
|
|
