Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Karim Atif

dblp:36/4754 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2Software engineering, systems software and programming languages · 2Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 94% Parallel and multicore computing · 6%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › numerical algorithms
decomposition methods
0.011991
Stochastic Automata Network For Modeling Parallel Systems · IEEE Trans. Software Eng. 1991
Performance modeling and evaluation › queueing models
markov chain model
0.011991
Stochastic Automata Network For Modeling Parallel Systems · IEEE Trans. Software Eng. 1991
Performance modeling and evaluation
state-space explosion
0.011991
Stochastic Automata Network For Modeling Parallel Systems · IEEE Trans. Software Eng. 1991
Performance modeling and evaluation › markov models
stochastic automata networks
0.011991
Stochastic Automata Network For Modeling Parallel Systems · IEEE Trans. Software Eng. 1991
Performance modeling and evaluation
stochastic modeling
0.011991
Stochastic Automata Network For Modeling Parallel Systems · IEEE Trans. Software Eng. 1991

Methods — techniques the papers use, named apart from their topics

tensor algebra · 0.0markovian analysis · 0.0
YearPublicationVenuePosition
2017 Fuzzy MDX queries for taking into account the ambiguity in querying the baccalaureate data warehouse
abstract
The decision maker tends to use natural language terms when interrogating a data warehouse, hence the need to integrate these terms into the data warehouse interrogation systems. In this article, we present a panorama of the work that has dealt with the treatment of ambiguity in decision-making queries and propose a solution that uses fuzzy logic and allows the interrogation of the data warehouse with terms derived from the language using fuzzy MDX queries.
Djamila Hammouche, Mourad Loukam, Karim Atif, Walid-Khaled Hidouci
CoDIT3
2008 A new fuzzy genetic algorithm for the dynamic bi-objective cell formation problem considering passive and active strategies
Menouar Boulif, Karim Atif
Int. J. Approx. Reason.2
2007 A fuzzy genetic algorithm for the dynamic cell formation problem
abstract
This paper deals with a fuzzy genetic algorithm applied to a manufacturing cell formation problem. We discuss the importance of taking into account the dynamic aspect of the problem that has been poorly studied in the related literature. Using a multi-periodic planning horizon modeling, two strategies are considered: passive and active. The first strategy consists of maintaining the same composition of machines during the overall planning horizon, while the second allows performing a different composition for each period. When the decision maker wants to choose the most adequate strategy for its environment, there is a need to control the proposed evolutionary solving approach, due to the complexity of the model. For that purpose, we propose an off-line fuzzy logic enhancement. The results, using this enhancement, are better than those obtained using the GA alone.
Menouar Boulif, Karim Atif
GECCO2
1991 Stochastic Automata Network For Modeling Parallel Systems
abstract
A methodology for modeling a system composed of parallel activities with synchronization points is proposed. Specifically, an approach based on a modular state-transition representation of a parallel system called the stochastic automata network (SAN) is developed. The state-space explosion is handled by a decomposition technique. The dynamic behavior of the algorithm is analyzed under Markovian assumptions. The transition matrix of the chain is automatically derived using tensor algebra operators, under a format which involves a very limited storage cost.>
Brigitte Plateau, Karim Atif
IEEE Trans. Software Eng.2