3335 search results - page 84 / 667 » Grid result checking |
DCC
2005
IEEE
15 years 11 months ago
2005
IEEE
In Theorem 6.1 of [3] it was shown that, when v = r + c - 1, every triple array TA(v, k, rr, cc, k : r ? c) is a balanced grid BG(v, k, k : r?c). Here we prove the converse of thi...
JSSPP
2005
Springer
15 years 5 months ago
2005
Springer
With Grids, we are able to share computing resources and to provide for scientific communities a global transparent access to local facilities. In such an environment the problems...
COCO
2006
Springer
15 years 3 months ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
SIAMDM
1998
14 years 11 months ago
1998
If f(m, n) is the (vertex) independence number of the m × n grid graph, then we show that the double limit η = def limm,n→∞ f(m, n) 1 mn exists, thereby refining earlier res...
107
click to vote
SP
2002
IEEE
14 years 11 months ago
2002
IEEE
provide a scalable and adaptable abstraction of the system architecture. Each agent is able to cooperate with other agents and thereby provide service advertisement and discovery f...