Luca Benini, Davide Bertozzi, Alessio Guerri, Michela Milano, Francesco Poletti
Multi-Processor Systems-on-Chips (MPSoCs) are becoming increasingly complex, and mapping and scheduling of multi-task applications on computational units is key to meeting performance constraints and...
CP-based Local Branching (2008)
Zeynep Kiziltan, Andrea Lodi, Michela Milano, Fabio Parisini
Abstract. We propose the integration and extension of the local branching search strategy in Constraint Programming (CP). Local branching is a general purpose heuristic method which searches locally...
Group-graphs associated with Row and Column Symmetries of Matrix Models: some observations (2008)
Zeynep Kiziltan, Michela Milano
Abstract. The effect of symmetry-breaking constraints is often evaluated empirically. In order to understand which symmetric configurations are removed by a set of constraints, we have to understand...
Challenging Scheduling Problem in the field of System Design (2008)
Alessio Guerri, Michele Lombardi, Michela Milano
Scheduling problems are of primary importance in many logistical, design and industrial applications. They can be very heterogeneous and often mix with a resource allocation phase which makes the...
Emiliano Dolif, Michele Lombardi, Martino Ruggiero, Michela Milano, Luca Benini
The increasing levels of system integration in Multi-Processor System-on-Chips (MPSoCs) emphasize the need for new design flows for efficient mapping of multi-task applications onto hardware...
A Constraint Logic Programming Approach to the Crew Rostering Problem (2007)
Evelina Lamma, Paola Mello, Michela Milano
In this paper, we present a constraint based approach to the Crew Rostering Problem. A solution to this problem is the optimal sequencing of a given set of duties into rosters in order to satisfy a...
Marco Gavanelli, Evelina Lamma, Paola Mello, Michela Milano
The Constraint Satisfaction Problem (CSP) is a good framework for dealing with combinatorial problems, but it does not take into account the interactive acquisition of the problem parameters. For...
Reasoning on Constraints in Constraint Logic Programming (2007)
Evelina Lamma, Evelina Lamma, Paola Mello, Paola Mello, Michela Milano, Michela Milano
Constraint Logic Programming solvers on finite domains use constraints to prune those combinations of assignments which cannot appear in any consistent solution. There are applications, such as...
MAGMA: A multiagent architecture for metaheuristics (2007)
Andrea Roli, Andrea Roli, Michela Milano, Michela Milano
Abstract. In this work we introduce a multiagent architecture conceived as a conceptual and practical framework for metaheuristic algorithms (MAGMA, MultiAGent Metaheuristics Architecture)....
Universita degli Studi di Bologna DEIS (2007)
Alessio Guerri, Alessio Guerri, Michela Milano, Michela Milano
Exploring CP-IP based techniques for the bid evaluation in combinatorial auctions
AUTOMATED DNA CURVATURE PROFILE RECONSTRUCTION IN ATOMIC FORCE MICROSCOPE IMAGES (2007)
Elisa Ficarra, Daniele Masotti, Luca Benini, Michela Milano
An automated algorithm is presented to determine the DNA molecule intrinsic curvature profiles and the molecular spatial orientations in Atomic Force Microscope images. The curvature is composed by...
Rosy Barruffi, Michela Milano, Rebecca Montanari
Security Management is a key issue in distributed computer systems. Resources and data need to be protected against unauthorized access, manipulation and malicious intrusions that render a system...
Allocation, scheduling and voltage scaling on energy aware mpsocs (2006)
Luca Benini, Davide Bertozzi, Alessio Guerri, Michela Milano
Abstract. In this paper we introduce a complex allocation and scheduling problem for variable voltage Multi-Processor System-on-Chip (MP-SoC) platforms. We propose a methodology to formulate and...
Elicitation and Application of Narrative Constraints Through Mixed- (2006)
Jorge Baier, Jeremy Hussell, Fahiem Bacchus, Sheila A. Mcilraith, Minh B. Do, J. Benton, ...
The planning community has traditionally been primarily concerned with the problem of generating a plan that satisfies a collection of goals. In many real-world planning problems, it is necessary to...
Allocation, scheduling and voltage scaling on energy aware mpsocs (2006)
Luca Benini, Luca Benini, Davide Bertozzi, Davide Bertozzi, Alessio Guerri, Alessio Guerri, ...
Abstract. In this paper we introduce a complex allocation and scheduling problem for variable voltage Multi-Processor System-on-Chip (MPSoC) platforms. We propose a methodology to formulate and solve...
Stochastic Allocation and Scheduling for Conditional Task Graphs in MPSoCs (2006)
Techical Report, Michele Lombardi, Michela Milano
Abstract. This paper describes a complete and efficient solution to the stochastic allocation and scheduling for Multi-Processor System-on-Chip (MPSoC). Given a conditional task graph characterizing...
Allocation, scheduling and voltage scaling on energy aware mpsocs (2006)
Luca Benini, Luca Benini, Davide Bertozzi, Davide Bertozzi, Alessio Guerri, Alessio Guerri, ...
1 DEIS Universit`a di BolognaV.le Risorgimento, 2
Allocation and scheduling for mpsocs via decomposition and no-good generation (2005)
Luca Benini, Davide Bertozzi, Alessio Guerri, Michela Milano
This paper proposes a decomposition approach to the allocation and scheduling of a multi-task application on a multiprocessor system-on-chip (MPSoCs) [Wolf, 2004]. This is currently one of the most...
Allocation and Scheduling for MPSoCs via decomposition and no-good generation (2005)
Mpsocs Via Decomposition, Luca Benini, Davide Bertozzi, Alessio Guerri, Michela Milano, Luca Benini, ...
Abstract. This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constraint for a...
Allocation and scheduling for mpsocs via decomposition and no-good generation (2005)
Luca Benini, Davide Bertozzi, Alessio Guerri, Michela Milano
Abstract. This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constraint for a...
Multiconsistency and Robustness with Global Constraints (2005)
Elbassioni, Khaled, Katriel, Irit, Barták, Roman, Milano, Michela
We propose a natural generalization of arc-consistency, which we call multiconsistency: A value $v$ in the domain of a variable $x$ is $k$-multiconsistent with respect to a constraint $C$ if there...
A CHR-based Implementation of Known Arc-Consistency (2004)
Alberti, Marco, Gavanelli, Marco, Lamma, Evelina, Mello, Paola, Milano, Michela
In classical CLP(FD) systems, domains of variables are completely known at the beginning of the constraint propagation process. However, in systems interacting with an external environment, acquiring...
Postponing Branching Decisions (2004)
Van Hoeve, Willem Jan, Milano, Michela
Solution techniques for Constraint Satisfaction and Optimisation Problems often make use of backtrack search methods, exploiting variable and value ordering heuristics. In this paper, we propose and...
Making choices using structure at the instance level within a case based reasoning framework (2004)
Cormac Gebruers, Alessio Guerri, Brahim Hnich, Michela Milano
Marco Alberti, Marco Gavanelli, Evelina Lamma, Paola Mello, Michela Milano
In classical CLP(FD) systems, domains of variables are completely known at the beginning of the constraint propagation process. However, in systems interacting with an external environment, acquiring...
Making choices using structure at the instance level within a case based reasoning framework (2004)
Cormac Gebruers, Alessio Guerri, Brahim Hnich, Michela Milano
Abstract. We describe using Case Based Reasoning to explore structure at the instance level as a means to distinguish whether to use CP or IP to solve instances of the Bid Evaluation Problem. 1
Postponing Branching Decisions (2004)
Solution techniques for Constraint Satisfaction and Optimization Problems often make use of backtrack search methods, exploiting variable and value ordering heuristics. In this paper, we propose and...
Dealing with Incomplete Knowledge on CLP(FD) Variable Domains (2003)
Marco Gavanelli, Evelina Lamma, Paola Mello, Michela Milano
Constraint Logic Programming languages on Finite Domains, CLP(FD), provide a declarative framework for Artificial Intelligence problems. However, in many real life cases, domains are not known and...
Università degli Studi di Bologna DEIS (2003)
Alessio Guerri, Michela Milano, Alessio Guerri, Michela Milano
for the bid evaluation in combinatorial auctions
Reduced cost-based ranking for generating promising subproblems (2002)
Abstract. In this paper, we propose an effective search procedure that interleaves two steps: subproblem generation and subproblem solution. We mainly focus on the first part. It consists of a...
A hybrid exact algorithm for the TSPTW (2002)
The Traveling Salesman Problem with Time Windows (TSPTW) is the problem of finding a minimum-cost path visiting a set of cities exactly once, where each city must be visited within a specific time...
Metaheuristics: A multiagent perspective (2001)
Andrea Roli, Andrea Roli, Michela Milano, Michela Milano
1 1
Global constraints: When constraint programming meets operation research (2001)
Michela Milano, Greger Ottosson, Erlendur S. Thorsteinsson, Antipolis France
Eorts aimed at combining Operations Research and Constraint Programming have become increasingly prominent and successful in the last few years. It is now widely recognised that integrating inference...
– Combinatorial Optimization Problems – AI and OR techniques • Comparisons (2001)
– problem modelling
Michela Milano Greger, Michela Milano, Greger Ottosson, Erlendur S. Thorsteinsson
Efforts aimed at combining Operations Research and Constraint Programming have become increasingly prominent and successful in the last few years. It is now widely recognized that integrating...
– problem modelling – problem solving: • Optimization – branch & bound – branch & cut – column generation
Consistent Orderings for Constraint Satisfaction Scheduling (1997)
Silvia Buzzi, Silvia Buzzi, Evelina Lamma, Evelina Lamma, Paola Mello, Paola Mello, ...
. The job shop scheduling problem has been formulated in Constraint Logic Programming as one of finding a consistent assignment of start times for each operation of each job. Nonetheless, in some...
Interactive Constraint Satisfaction (1997)
Rita Cucchiara, Rita Cucchiara, Evelina Lamma, Evelina Lamma, Paola Mello, Paola Mello, ...
. We present an Interactive Constraint Satisfaction model for problems where knowledge is not completely defined at the beginning of the computation, but can be interactively acquired during the...
An Interactive Constraint-Based System for Selective Attention in Visual Search (1997)
Rita Cucchiara, Evelina Lamma, Paola Mello, Michela Milano, R. Cucchiara, E. Lamma, ...
. We face in this paper the problem of model-based object recognition in a scene. Computer vision techniques usually separate the extraction of visual information from the scene from the reasoning on...
An Incremental Consistency Algorithm for Adaptive Constraint Satisfaction (1997)
Evelina Lamma, Paola Mello, Michela Milano
. Constraint Satisfaction Problems (CSPs) play a central role in many Artificial Intelligence fields. Many different approaches have been proposed for solving CSPs ranging from pure backtracking to...
A Meta Constraint Logic Programming Scheme (1995)
Evelina Lamma, Evelina Lamma, Paola Mello, Paola Mello, Michela Milano, Michela Milano
. Keywords: A Meta Constraint Logic Programming Scheme elamma,mmilano @deis.unibo.it pmello@deis.unibo.it Evelina Lamma Paola Mello Michela Milano October 10, 1995 DEIS, Universit`a di Bologna Viale...