Why Sakana AI’s big win is a big deal for the future of enterprise agents

By leveraging inference-time scaling and a novel "reflection" mechanism, ALE-Agent solves the context-drift problems that ...
IEEE

On solving the most strings with few bad columns problem: An ILP model and heuristics

Abstract: The most strings with few bad columns problem is an NP-hard combinatorial optimization problem from the bioinformatics field. This paper presents the first integer linear programming model ...
IEEE

Solving Euclidean minimal spanning tree problem using a new meta-heuristic approach: Imperialist Competitive algorithm (ICA)

Abstract: The minimum spanning tree (MST) problem has numerous applications in design of communication, computer and transportation networks. This paper proposes an application of a new meta-heuristic ...