#np-hard News & Analysis

2 articles tagged with #np-hard. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

2 articles

AINeutralarXiv – CS AI · Jun 36/10

🧠

Don't Gamble, GAMBLe: An Analytical Framework for AI-Driven Research Systems

Researchers introduce GAMBLe, a framework for analyzing AI-Driven Research Systems (ADRS) that couple large language models with automated evaluation. Through 760+ experiments, the framework reveals that standard convergence guarantees fail to capture ADRS behavior, and component selection can improve performance by 13-67% depending on the problem.

AINeutralarXiv – CS AI · May 286/10

🧠

A Fresh Look at Lamarckian Evolution and the Baldwin Effect

Researchers demonstrate that Baldwinian and Lamarckian evolutionary algorithms significantly outperform traditional Darwinian evolution on complex optimization problems like Maximum Independent Set and Maximum Cut. The study provides both empirical validation across multiple datasets and theoretical runtime analysis, showing that local search-augmented evolutionary algorithms offer practical advantages for solving NP-hard graph problems.