205 search results - page 21 / 41 » Grid Graph Reachability Problems |
SIAMJO
2010
13 years 4 months ago
2010
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
CORR
2004
Springer
13 years 9 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 ...
ALGORITHMICA
2008
13 years 10 months ago
2008
Grid computing systems pool together the resources of many workstations to create a virtual computing reservoir. Users can "draw" resources using a pay-as-you-go model, c...
ICALP
2007
Springer
14 years 4 months ago
2007
Springer
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optim...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...