We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorg...
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a feasible alte...
Ivo Couckuyt, Dirk Gorissen, Hamed Rouhani, Eric L...
Evolutionary search algorithms have become an essential asset in the algorithmic toolbox for solving high-dimensional optimization problems in across a broad range of bioinformati...
High–dimensional optimization problems appear very often in demanding applications. Although evolutionary algorithms constitute a valuable tool for solving such problems, their ...