672 search results - page 52 / 135 » A General Solution to the Graph History Interaction Problem |
GECCO
2008
Springer
13 years 8 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...
TKDE
2008
13 years 7 months ago
2008
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...
FUIN
2000
13 years 7 months ago
2000
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
IJES
2006
13 years 7 months ago
2006
: We present efficient solutions for the non-contiguous linear placement of data-paths for reconfigurable fabrics. A strip-based architecture is assumed for the reconfigurable fabr...
TAMODIA
2007
13 years 8 months ago
2007
Abstract. Covering quality aspects such as usability through the software development life cycle is challenging. These “-ilities” are generally difficult to grasp and usually ...