365 search results - page 33 / 73 » Reconfigurations in Graphs and Grids |
156
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Owing to its nice properties, the pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. In ...
157
click to vote
IJON
2007
15 years 6 months ago
2007
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...
165
click to vote
IWOCA
2009
Springer
16 years 19 days ago
2009
Springer
A circuit in a simple undirected graph G = (V, E) is a sequence of vertices {v1, v2, . . . , vk+1} such that v1 = vk+1 and {vi, vi+i} ∈ E for i = 1, . . . , k. A circuit C is sai...
171
click to vote
PDP
2003
IEEE
15 years 11 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
171
Voted
PDP
2008
IEEE
16 years 14 days ago
2008
IEEE
This paper presents QLSE (QoS-constrained List Scheduling hEuristics), a Quality of Service-based launch time scheduling algorithm for wide area Grids. QLSE considers applications...