#### Filter Results:

#### Publication Year

1992

2007

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is assumed to have complete knowledge of the graph and of the searchers' moves, but is restricted to move only along paths whose vertices are not guarded by searchers. The search number… (More)

Labelling the lines of a planar line drawing of a 3-D object in a way that reflects the geometric properties of the object is a much studied problem in computer vision, considered to be an important step towards understanding the object from its 2-D drawing. Combinatorially, the labellability problem is a Constraint Satisfaction Problem and has been shown… (More)

A constraint network is arc consistent if any value of any of its variables is compatible with at least one value of any other variable. The Arc Consistency Problem (ACP) consists in ltering out values of the variables of a given network to obtain one that is arc consistent, without eliminating any solution. ACP is known to be inherently sequential, or… (More)

- N. Dendris, P. Parodi
- 2007

This paper describes the design and the analysis of parallel algorithms for the interpretation of planar or perspective projections of scenes constructed by some generating grammar (trihedral scenes, Manhattan world, Origami scenes, Pottery world). The motivation is that parallel techniques are more and more studied in Articial Intelligence and Computer… (More)

This paper presents an extended MRP II-based production management system (PMS), which improves the traditional MRP II paradigm by attaching an intelligent decision supporting system (IDSS) to it. The IDSS is attached to the lowest level of the PMS, namely the production activity control (PAC) subsystem, and includes a simulator, that imitates real system… (More)

A constraint network is arc consistent if any value of any of its variables is compatible with at least one value of any other variable. The Arc Consistency Problem (ACP) consists in filtering out values of the variables of a given network to obtain one that is arc consistent, without eliminating any solution. ACP is known to be inherently sequential, or… (More)

- ‹
- 1
- ›