365 search results - page 31 / 73 » Reconfigurations in Graphs and Grids |
IEEEPACT
1999
IEEE
14 years 3 months ago
1999
IEEE
This paper presents the Cameron Project 1 , which aims to provide a high level, algorithmic language and optimizing compiler for the development of image processing applications o...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We consider the problem of self-healing in networks that are reconfigurable in the sense that they can change their topology during an attack. Our goal is to maintain connectivity...
TKDE
2008
13 years 11 months ago
2008
Given a transportation network having source nodes with evacuees and destination nodes, we want to find a contraflow network configuration (that is, ideal direction for each edge) ...
IEEESCC
2005
IEEE
14 years 4 months ago
2005
IEEE
Service integration, the ultimate goal of Shanghai Grid, has created a necessity for more efficient and effective workflow infrastructure. Workflow design tool is one core compone...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...