4565 search results - page 181 / 913 » Time Optimal Self-Stabilizing Algorithms |
ISAAC
2005
Springer
14 years 4 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
GECCO
2008
Springer
13 years 12 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
CCE
2004
13 years 10 months ago
2004
It is common that external procedures are incorporated into an equation-oriented model when modeling complex chemical process systems. The so-obtained models are called composite ...
DAC
2009
ACM
14 years 11 months ago
2009
ACM
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access will result in a definite cache hit or miss. This unpredictabilit...
IEEECIT
2010
IEEE
13 years 9 months ago
2010
IEEE
—Superblocks represent regions in a program code that consist of multiple basic blocks. Compilers benefit from this structure since it enables optimization across block boundari...