Excellence in Research and Innovation for Humanity
7 results found

ICDAA 2019 Dubai

Mar 11-12, 2019
International Conference on Design and Analysis of Algorithms
Submissions due:
2019-02-11 00:00:00
Conference Details

ICDACA 2018 Barcelona

Dec 17-18, 2018
International Conference on Design and Analysis of Computer Algorithms
Submissions due:
2018-11-16 00:00:00
Conference Details

ICCAAD 2018 Amsterdam

Dec 03-04, 2018
International Conference on Computer Algorithms, Analysis and Design
Submissions due:
2018-11-05 00:00:00
Conference Details

ICCADA 2018 Sydney

Dec 03-04, 2018
International Conference on Computer Algorithms, Design and Analysis
Submissions due:
2018-11-02 00:00:00
Conference Details

ICDACA 2017 Barcelona

Dec 14-15, 2017
International Conference on Design and Analysis of Computer Algorithms
Submissions due:
2017-11-14 00:00:00
Conference Details

Design of Gravity Dam by Genetic Algorithms

The design of a gravity dam is performed through an interactive process involving a preliminary layout of the structure followed by a stability and stress analysis. This study presents a method to define the optimal top width of gravity dam with genetic algorithm. To solve the optimization task (minimize the cost of the dam), an optimization routine based on genetic algorithms (GAs) was implemented into an Excel spreadsheet. It was found to perform well and GA parameters were optimized in a parametric study. Using the parameters found in the parametric study, the top width of gravity dam optimization was performed and compared to a gradient-based optimization method (classic method). The accuracy of the results was within close proximity. In optimum dam cross section, the ratio of is dam base to dam height is almost equal to 0.85, and ratio of dam top width to dam height is almost equal to 0.13. The computerized methodology may provide the help for computation of the optimal top width for a wide range of height of a gravity dam.
details

Computing Maximum Uniquely Restricted Matchings in Restricted Interval Graphs

A uniquely restricted matching is defined to be a
matching M whose matched vertices induces a sub-graph which has
only one perfect matching. In this paper, we make progress on the
open question of the status of this problem on interval graphs (graphs
obtained as the intersection graph of intervals on a line). We give
an algorithm to compute maximum cardinality uniquely restricted
matchings on certain sub-classes of interval graphs. We consider two
sub-classes of interval graphs, the former contained in the latter, and
give O(|E|^2) time algorithms for both of them. It is to be noted that
both sub-classes are incomparable to proper interval graphs (graphs
obtained as the intersection graph of intervals in which no interval
completely contains another interval), on which the problem can be
solved in polynomial time.
details