Rossi, Francesca - Dipartimento di Matematica Pura e Applicata, Universit� degli Studi di Padova

Advanced Search

Rossi, Francesca - Dipartimento di Matematica Pura e Applicata, Universit� degli Studi di Padova

Esercizi reti combinatorie e sequenziali
Labelling Heuristics for CSP Application Domains
Symmetry Breaking in Peaceably Coexisting Armies of Queens
On linear constraints with uncertain coecients
Male optimality and uniqueness in stable marriage problems with partial orders
nome e cognome: Automi e Linguaggi Formali A.A. 2008/2009
Computing possible and necessary winners from incomplete partially-ordered preferences
Esercizi linguaggio ciclo: add z
My Research: Randomization and Restart in SAT and
A Modeling Framework for Constraints Gerrit Renker
Reti combinatorie: Appendice A + dispense
Asynchronous Search for Numerical CSPs MariusCalin Silaghi, Djamila SamHaroud, and Boi Faltings
Uniform Framework for Solving OverConstrained and Optimization Problems
Sequential majority voting with incomplete profiles M. S. Pini, F. Rossi and K. B. Venable
New South Wales New South Wales
per leggere la posta Per la visualizzazione dei messaggi contenuti nella propria casella e-mail necessario
Constraints Algorithms,
Two solvers for tractable temporal constraints with preferences F. Rossi 1 , K.B. Venable 1 , L. Khatib 2;3 , P. Morris 3 , R. Morris 3
On the Dynamic Detection of Interchangeability in Finite Constraint Satisfaction Problems
Linee guida per i Corso di Sistemi con vincoli
Grammatiche libere da contesto Grammatiche libere da contesto
The Next Best Solution Ben Gurion Univ., Beer-Sheva, Israel
3 12 8 2 4 6 14 5 2 strategia strategia strategia
Influencing and aggregating agents' preferences over combinatorial domains Nicolas Maudet1
Aircraft Assignment: A Basic CP Model Erik Kilborn
Abstracting Soft Constraints S. Bistarelli 1 , P. Codognet 2 , Y. Georget 3 , F. Rossi 4
A Concurrent Constraint Programming Approach for Trajectory Determination of
An Abstraction Framework for Soft Constraints, And Its Relationship with Constraint
Veri cation of In nite-State Systems by Specialization of CLP Programs
Linguaggio macchina Capitolo 10
Modelling for Constraint Programming Barbara M. Smith
A Linear Programming based Satisfiability solver using a new
General Properties and Termination Conditions for Soft Constraint Propagation
Constraint-based Methods in Object-Oriented Programming Environments
Imprecise Soft Constraint Problems Mirco Gelain1
Riassunto argomenti Sommario degli argomenti di
Uncertainty in Bipolar Preference Problems Stefano Bistarelli1,2
A Method for Comparing Soft Constraint CWI ? & ILLC
CALL FOR PAPERS Special Issue of the Constraints Journal
Batch Processing with Sequence Dependent Setup Times: Using Precedence Graph
Constraint Logic Programming Francesca Rossi ?
Reducing Symmetry in Matrix Models # Zeynep Kzltan
Macchine di Turing, problemi ricorsivi e ricorsivamente enumerabili
Soft constraint processing Thomas Schiex (INRA, Toulouse, France)
Managing IllDefined Components in Real World Constraint Problems
Research Interests Brent Venable, University of Padova
Extended Abstract CP 2002 Doctoral Programme
SCSPs for Modelling Attacks to Security Protocols
Constraint Programming The Constraint Programming Working Group \Lambda
Improving Cost Calculations for Global Constraints in Local Search
Notes for the ECAI2000 tutorial on Solving and Programming with Soft Constraints
Automatic Generation of Implied Clauses for Lyndon Drake, Alan Frisch, and Toby Walsh
An Incremental and Nonbinary CSP Solver: The Hyperpolyhedron Search Algorithm
Il pumping lemma Proprieta' di chiusura
La programmazione con vincoli in breve La programmazione con vincoli in breve
Laboratorio 23-10-2008 CPUSIM PARTE2
Constraint Propagation for Soft Constraint Satisfaction Problems: Generalization and
Under consideration for publication in Theory and Practice of Logic Programming 1 An Interactive Semantics of Logic Programming
On Finding Graphically Plausible Solutions to Constraint Hierarchies: The Split Stay Problem
Improving Satis ability Algorithms by Using Search Pruning Techniques
Certainty Closure On Tackling Constraint Problems with Uncertain Data
Automi a pila Automi a pila
Search in Asynchronous Constraint Solving Georg Ringwelski
Partial Symmetry Breaking Iain McDonald
Controllability of Soft Temporal Constraint Problems Francesca Rossi 1 , Kristen Brent Venable 1 , and Neil YorkeSmith 2
Sistemi con vincoli A.A. 2009/2010 22 Giugno 2010
Handbook of Constraint Programming 495 Francesca Rossi, Peter van Beek, Toby Walsh
Laboratorio 04-09-2008 CPUSIM PARTE3
Environment What it will be like
Design of a new metaheuristic for MAXSAT problems
Multiagent meeting scheduling with preferences: efficiency, privacy loss, and solution quality
Temporal Concurrent Constraint Programming (Ext. Abstract) Frank D. Valencia
Semiring-based Constraint Logic Programming: Syntax and Semantics
Constraint Satisfaction Using Soft Quantifiers Ronald R. Yager
Laboratorio 14-10-2008 Uso laboratorio informatico
CP nets: representing and reasoning with preferences of multiple agents We introduce CP nets, an extension of the CP net formal-
Optimum Symmetry breaking in CSPs using Group Theory
Higher Order Semiringbased Constraints Stefano Bistarelli 1 , Ugo Montanari 1 , Francesca Rossi 2
Extended Abstract: Dynamic Distributed Constraint Satisfaction for Resource Allocation
Constraint Modeling in the Context of Academic Task Assignment
First International School onFirst International School onFirst International School onFirst International School on Constraint ProgrammingConstraint ProgrammingConstraint ProgrammingConstraint Programming 2005200520052005
Finding the next solution in constraint-and preference-based knowledge representation formalisms
Comparing SAT Encodings for Model Checking Alan Frisch, Daniel Sheridan, and Toby Walsh
Treebased RDS 1 Introduction
Espressioni regolari Espressioni regolari
Non-binary Disjunctive Constraint Satisfaction Miguel A. Salido, Federico Barber
Automatic Generation of Implied Clauses for SAT Lyndon Drake, Alan Frisch, and Toby Walsh
Models of Injection Problems Brahim Hnich 1 and Toby Walsh 2
Computing Explanations and Implications in Preference-Based Con gurators
Exploiting the Structure of Constraint Satisfaction Problems by Interchangeability
Design Tradeoffs for Autonomous Trading Agents Ioannis A. Vetsikas
Esercizi rappresentazioni Da complemento a 2 a base 10
Robust solutions in unstable optimization Maria Silvia Pini1
Automi e Linguaggi Formali Docente: Francesca Rossi
Automi a pila Automi a pila
Abstracting Soft Constraints: Some Experimental Results on Fuzzy CSPs
Soft Concurrent Constraint Programming Stefano Bistarelli1, Ugo Montanari2, and Francesca Rossi3
Interactive Heuristic Search Algorithm Toms Mller
Local search for stable marriage problems1 M. Gelain and M. S. Pini and F. Rossi and K. B. Venable and T. Walsh
Parsing bottom-up Idea del parsing bottom-up
Circuiti e reti combinatorie Appendice A (libro italiano)
Modelling and solving bipolar preference problems Stefano Bistarelli1
Global Constraints Jean-Charles Regin
Da pattern ad analizzatore lessicale Da pattern ad analizzatore lessicale
Linguaggio macchina --2 Capitolo 10
Bridging the Gap between SAT and CSP ? Carlos Ans otegui
Automi e Linguaggi Formali A.A. 2010/2011 1. Data la grammatica S aaS | b | , calcolare il FIRST e il FOLLOW
Aggregating preferences cannot be fair Francesca Rossi1, Kristen Brent Venable1, Toby Walsh2
Tuning Randomization in Backtrack Search SAT Algorithms
Representing and Coping with Recurrent Change in Dynamic Constraint Satisfaction Problems \Lambda
Distributed Dynamic Backtracking Christian Bessire 1 , Arnold Maestre 1 , and Pedro Meseguer 2
Problemi intrattabili, classi P e NP Problemi intrattabili, classi P e NP
Bipolar preference problems Stefano Bistarelli, Maria Silvia Pini , Francesca Rossi and K. Brent Venable 1
Incompleteness and Incomparability in Preference Aggregation M. S. Pini1
Distributed Constraint-Based Railway -Extended Abstract of Planned Dissertation -
A constraintpropagation approach to quantified constraints
Aritmetica del calcolatore (virgola mobile)
Local search for stable marriage problems with ties and incomplete lists
CONSTRAINT PROPAGATION AND BACKTRACKING-BASED SEARCH
Reti sequenziali Seppure le reti combinatorie permettono di realizzare funzioni aritmetico-logiche, esse non sono in grado di realizzare una
Controllability of Soft Temporal Constraint Problems Francesca Rossi
Sistemi con vincoli Docente: Francesca Rossi
Problemi di soddisfazione di vincoli: esempi Problemi di soddisfazione di vincoli: esempi
Alcuni risolutori completi Alcuni risolutori completi
Alcuni risolutori incompleti Alcuni risolutori incompleti
The Alldifferent Constraint: A Survey Willem-Jan van Hoeve vanhoeve@cs.cornell.edu
Constraint Propagation Christian Bessiere
Sistemi con vincoli A.A. 2008/2009 6 Luglio 2009
Automi e Linguaggi Formali Esempio di primo compitino
Linguaggi regolari e automi a stati finiti Linguaggi regolari e automi a stati finiti
Equivalenza e minimizzazione di automi Equivalenza e minimizzazione di automi
Grammatiche libere da contesto Grammatiche libere da contesto
Proprieta' dei linguaggi liberi da contesto Proprieta' dei linguaggi liberi da contesto
Analisi sintattica Analisi sintattica
Linguaggio universale, riduzioni, e teorema di Rice Linguaggio universale, riduzioni, e teorema di Rice
Informazioni Sistemi con vincoli
Linguaggi regolari e automi a stati finiti Linguaggi regolari e automi a stati finiti
Problemi intrattabili, classi P e NP Problemi intrattabili, classi P e NP
Reti Combinatorie Un calcolatore costituito da circuiti digitali (hardware) che provvedono a realizzare fisicamente il calcolo. Tali circuiti
Architettura degli Elaboratori
Componenti e connessioni Componenti principali
Linguaggio macchina esempio in CPUSim
Aritmetica del calcolatore Unita' aritmetica e logica
Esercizi e domande Architettura di Von Neumann -1
Tavola di verita' f = ABC+not(A)not(B)C
Laboratorio 21-10-2008 CPUSIM PARTE1
Constraint-Based Scheduling: A Tutorial Claude Le Pape
CP Summer School: Hybrid algorithms, local search, and Eclipse
First International School on Constraint Programming 2005
Algoritmi di propagazione di vincoli Algoritmi di propagazione di vincoli
Sistemi con vincoli A.A. 2009/2010 15 Dicembre 2010
Introduzione all'architettura degli elaboratori nome............................... Cognome...............................
Weights in stable marriage problems increase manipulation opportunities Maria Silvia Pini1
Weights in stable marriage problems increase manipulation opportunities
Multi-agent soft constraint aggregation via sequential voting Giorgio Dalla Pozza, Maria Silvia Pini, Francesca Rossi and K. Brent Venable
Procedural Fairness in Stable Marriage Problems (Extended Abstract)
MULTI-AGENT SOFT CONSTRAINT AGGREGATION: A SEQUENTIAL APPROACH
Stable marriage problems with quantitative preferences
Interval-valued Soft Constraint Problems , M. S. Pini1
Local search algorithms on the Stable Marriage Problem: Experimental Studies
Constraint Logic Programming Marco Gavanelli1
Finding the Next Solution in Constraint-and Preference-based Knowledge Representation Formalisms
Elicitation Strategies for Soft Constraint Problems with Missing Preferences: Properties,
Male optimal and unique stable marriages with partially ordered preferences
Compact preference representation in stable marriage E. Pilotto1
Manipulation and gender neutrality in stable marriage Maria Silvia Pini
From soft constraints to bipolar preferences: modelling framework and solving issues
Dynamic Consistency of Fuzzy Conditional Temporal Problems Marco Falda, Francesca Rossi, K. Brent Venable
Elicitation strategies for fuzzy constraint problems with missing preferences: algorithms and experimental
Constraints and Preferences: Modelling Frameworks and Multi-agent
Comparing the notions of optimality in CP-nets, strategic games and soft constraints
Aggregating partially ordered preferences Maria Silvia Pini1, Francesca Rossi1, Kristen Brent Venable1, Toby Walsh2
Volume title 1 The editors
Dealing with Incomplete Preferences in Soft Constraint Mirco Gelain, Maria Silvia Pini, Francesca Rossi, and K. Brent Venable
Bipolar preference problems: framework, properties and solving techniques
Winner Determination in Sequential Majority Voting , M. S. Pini2
AI Communications 20 (2007) 181209 181 Solving and learning a tractable class of soft
Winner Determination in Sequential Majority Voting with Incomplete Preferences
Incompleteness and Incomparability in Preference Aggregation
Strategic voting when aggregating partially ordered preferences
CP 2005 Sitges, Spain, October 3, 2005 Preference Reasoning
Fuzzy Conditional Temporal Problems: dynamic consistency and comparison with STPPUs
Dealing with Incomplete Agents' Preferences and an Uncertain Agenda in Group Decision Making via Sequential Majority Voting
Learning and Solving Soft Temporal Constraints: An Experimental Study
Solving and Programming with Soft constraints
Partially Ordered Constraint Optimization M. Gavanelli 1
Abstracting Soft Constraints: Some Experimental Results
Hard and soft constraints for reasoning about qualitative conditional preferences
CPU e linguaggio macchina domande ed
CP-nets and Nash equilibria Krzysztof R. Apt
Constrained CP-nets Steve Prestwich1
E' un editor di testo ma anche un ambiente di sviluppo integrato, cio possibile utilizzarlo sia per scrivere un programma che per compilare quest'ultimo ed eseguirlo rimanendo all'interno di Emacs.
A comparison of the notions of optimality in soft constraints and graphical games
Learning Preferences on Temporal Constraints: A Preliminary Report University of Padova, Italy
Fuzzy hierarchies F. Boussemart 1 , C. Lecoutre 1 , S. Merchez 1,2 , E. Grgoire 2
Building Negative Reduced Cost Paths Using Constraint Programming.
, , 1{18 () Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
Explanations and optimization in preference-based con gurators
Studying Interchangeability in Constraint Satisfaction Problems
Constraint Processing Techniques for Model-Based Reasoning
Linux un sistema operativo di tipo Unix. La principale differenza rispetto ai "veri" sistemi Unix consiste nel fatto che Linux pu essere copiato liberamente e gratuitamente,
Semiring-based Constraint Satisfaction and Optimization Stefano Bistarelli Ugo Montanari Francesca Rossi
Sistemi con vincoli A.A. 2008/2009 19 Giugno 2009
Reti sequenziali Appendice A + dispensa
Possibility theory for reasoning about uncertain soft constraints
studies CP2001 Constraints
Flexibility as Relaxation The Fuzzy Set View
Abstracting Soft Constraints: Framework, Properties, Examples
Distributed Constraint Satisfaction as A Computational Model of Negotiation via Argumentation ?
A LOCAL SEARCH APPROACH TO SOLVE INCOMPLETE FUZZY Mirco Gelain, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable
Manipulation complexity and gender neutrality in stable marriage procedures
Automi e Linguaggi Formali Docente: Francesca Rossi
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs
Fogli Elettronici Un foglio elettronico (o spreadsheet) e` un software
Parsing bottom-up: LR(1) e LALR
Intelligenza artificiale Francesca Rossi, Alessandro Sperduti
Consistenze basate sui domini e piu' forti di AC Algoritmi per AC
HighLevel Modelling and Reformulation of Constraint Satisfaction Problems
Nozioni di consistenza locale Nozioni di consistenza locale
nome e cognome: Automi e Linguaggi Formali A.A. 2008/2009
ACAI 2009, Belfast, August 2009 Preferences: soft constraints and CP
Global Constraints Jean-Charles Regin
USO DEL LABORATORIO INFORMATICO Orario di apertura: dal LUNED al VENERD dalle 09.00 alle 18.00
formulation: Optimization
Valued constraint networks Thomas Schiex
Counting Satis able k-CNF Formulas Mitchell A. Harris
Constraint-based Preferential Optimization Keyword: preferences, constraint satisfaction
Preference Reasoning Francesca Rossi
Winner Determination in Voting Trees with Incomplete Preferences and Weighted Votes
Modi di indirizzamento Capitolo 11
Automi e Linguaggi Formali A.A. 2011/2012 1. Dire se esiste un algoritmo (che termini in tempo finito) che, dato in
Automi e Linguaggi Formali Docente: Francesca Rossi
Automi e Linguaggi Formali A.A. 2011/2012 1. Dato l'automa a stati finiti deterministico descritto dalla seguente tabella
Problemi intrattabili, classi P e NP Problemi intrattabili, classi P e NP
L'intelligenza artificiale Francesca Rossi
Influence and aggregation of preferences over combinatorial domains
Bribery in Voting Over Combinatorial Domains Is Easy (Extended Abstract)
Intelligenza Artificiale Agenti intelligenti
Intelligenza Artificiale Anno Accademico 2010/2011