On Search Problems in Complexity Theory and in Logic (Abstract)

2006 ◽  
pp. 5-5
Author(s):  
Pavel Pudlák
Keyword(s):  
Complexity Theory ◽  
Search Problems

Complexity theory and psychoanalysis

2005 ◽  
Author(s):  
Katherine Harper
Keyword(s):  
Complexity Theory

When reality bites back: Chaos/complexity theory for advocate leaders

2009 ◽  
Author(s):  
Michele B. Hill ◽  
Gregory L. Brack ◽  
Lydia Odenat
Keyword(s):  
Complexity Theory

Articulating a strategic approach to face complexity in design projects

2019 ◽  
Vol 2 (1) ◽  
Author(s):  
Luca SIMEONE ◽  
David DRABBLE ◽  
Giorgia IACOPINI ◽  
Kirsten VAN DAM ◽  
Nicola MORELLI ◽  
...  
Keyword(s):  
Complexity Theory ◽  
Wicked Problems ◽  
Theory Of Change ◽  
Strategic Action ◽  
Community Initiatives ◽  
Uncertain Environment ◽  
Strategic Approach ◽  
Design Projects

In today’s world of global wicked problems, constraints and imperatives imposed by an external and uncertain environment render strategic action a quite complex endeavour. Since the 1990s, within community initiatives and philanthropic projects, the construct of Theory of Change has been used to address such complexity. Theory of Change can be defined as the systematic and cumulative study of the links between the activities, outcomes, and context of an intervention. The area of focus for this paper is to explore whether Theory of Change can support more strategic approaches in design. In particular, the paper examines how Theory of Change was applied to DESIGNSCAPES - a project oriented, among other things, toward offering a supporting service for all those city actors interested in using design to develop urban innovation initiatives that tackle complex issues of broad concern.

Best Neighbor Heuristic Search for Finding Minimum Paths in Transportation Networks

1998 ◽  
Vol 1651 (1) ◽  
pp. 48-52 ◽  
Author(s):  
Jeffrey L. Adler
Keyword(s):  
Heuristic Search ◽  
Transportation Networks ◽  
Transportation Network ◽  
Search Problems ◽  
A Algorithm ◽  
Running Time ◽  
Search Effort ◽  
Wide Range ◽  
Path Search ◽  
Sparse Networks

For a wide range of transportation network path search problems, the A* heuristic significantly reduces both search effort and running time when compared to basic label-setting algorithms. The motivation for this research was to determine if additional savings could be attained by further experimenting with refinements to the A* approach. We propose a best neighbor heuristic improvement to the A* algorithm that yields additional benefits by significantly reducing the search effort on sparse networks. The level of reduction in running time improves as the average outdegree of the network decreases and the number of paths sought increases.

Sign in / Sign up

Export Citation Format

Share Document