#### Filter Results:

- Full text PDF available (43)

#### Publication Year

1998

2017

- This year (4)
- Last 5 years (38)
- Last 10 years (62)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Malek Mouhoub, François Charpillet, Jean Paul Haton
- Constraints
- 1998

Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed a temporal model, TemPro, based on the interval Algebra, to express such applications in term of qualitative and quantitative temporal constraints. TemPro extends the interval… (More)

- Reza Abbasian, Malek Mouhoub
- GECCO
- 2011

Graph coloring problems (GCPs) are constraint optimization problems with various applications including scheduling, time tabling, and frequency allocation. The GCP consists in finding the minimum number of colors for coloring the graph vertices such that adjacent vertices have distinct colors. We propose a parallel approach based on Hierarchical Parallel… (More)

- Reza Abbasian, Malek Mouhoub
- Applied Intelligence
- 2013

Graph Coloring Problems (GCPs) are constraint optimization problems with various applications including time tabling and frequency allocation. The GCP consists in finding the minimum number of colors for coloring the graph vertices such that adjacent vertices have distinct colors. We propose a hierarchical approach based on Parallel Genetic Algorithms… (More)

- Malek Mouhoub, Bahareh Jafari Jashmi
- GECCO
- 2011

A Constraint Satisfaction Problem (CSP) is a powerful framework for representing and solving constraint problems. When solving a CSP using a backtrack search method, one important factor that reduces the size of the search space drastically is the order in which variables and values are examined. Many heuristics for static and dynamic variable ordering have… (More)

- Malek Mouhoub, Samira Sadaoui, Amrudee Sukpan
- SEKE
- 2004

- Shubhashis Kumar Shil, Malek Mouhoub, Samira Sadaoui
- GECCO
- 2013

Nowadays, winner determination problem is one of the main challenges in the domain of real-time applications such as combinatorial reverse auctions. To determine the winner(s) in combinatorial reverse auctions, in our previous work, we have proposed a Genetic Algorithm (GA)-based method and have demonstrated its superiority in terms of processing time and… (More)

- Malek Mouhoub, Jia Liu
- SMC
- 2008

We propose a probabilistic extension of Allen’s Interval Algebra for managing uncertain temporal relations. Although previous work on various uncertain forms of quantitative and qualitative temporal networks have been proposed in the literature, little has been addressed to the most obvious type of uncertainty, namely the probabilistic one. More precisely,… (More)

- Malek Mouhoub, Amrudee Sukpan
- Applied Intelligence
- 2012

We present a new framework, managing Constraint Satisfaction Problems (CSPs) with preferences in a dynamic environment. Unlike the existing CSP models managing one form of preferences, ours supports four types, namely: unary and binary constraint preferences, composite preferences and conditional preferences. This offers more expressive power in… (More)

- Eisa Alanazi, Malek Mouhoub, Sandra Zilles
- IJCAI
- 2016

Learning of user preferences has become a core issue in AI research. For example, recent studies investigate learning of Conditional Preference Networks (CP-nets) from partial information. To assess the optimality of learning algorithms as well as to better understand the combinatorial structure of CP-net classes, it is helpful to calculate certain… (More)

- Shubhashis Kumar Shil, Malek Mouhoub
- IEA/AIE
- 2014