Sciweavers

3198 search results - page 121 / 640
» Evolutionary Computation in Structural Design
Sort
View

Book
537views
17 years 1 months ago
How to Think Like a Computer Scientist: Java Version
""The goal of this book is to teach you to think like a computer scientist. I like the way computer scientists think because they combine some of the best features of Mat...
Allen B. Downey

Book
1497views
17 years 1 months ago
How to Think Like a Computer Scientist: C++ Version
"The goal of this book is to teach you to think like a computer scientist. I like the way computer scientists think because they combine some of the best features of Mathemati...
Allen B. Downey
ICALP
2010
Springer
15 years 7 months ago
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
Loukas Georgiadis
JPDC
2006
134views more  JPDC 2006»
15 years 4 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
IICS
2001
Springer
15 years 8 months ago
Computer-Supported Deliberations for Distributed Teams
In our terminology, a “deliberation” is a distributed collaborative process, more or less spontaneous, structured, and complex. This process can include both individual and col...
Jacques Lonchamp, Fabrice Muller