Search Results for author:
Found 2 papers, 0 papers with code
Dilemma First Search for Effortless Optimization of NP-Hard Problems
We evaluate DFS on two problems: First, the Knapsack problem, for which efficient algorithms exist, serves as a toy example.
Is There a Procedural Logic to Architecture?
Urban models are key to navigation, architecture and entertainment.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
