In this paper, we report from an experiment which compared the E3 PML with respect to the standard modelling language IDEF0 for the purpose of model construction. The experiment ha...
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
Abstract. It is now recognized that the Consensus problem is a fundamental problem when one has to design and implement reliable asynchronous distributed systems. This chapter is o...
Rachid Guerraoui, Michel Hurfin, Achour Most&eacut...
Model-based clustering of motion trajectories can be posed as the problem of learning an underlying mixture density function whose components correspond to motion classes with dif...
: In this paper, we address a lot splitting and scheduling problem existent in a textile factory. The factory we study produces a set of products that are made of, or assembled fro...
Carina Pimentel, Filipe Pereira Alvelos, Antonio D...