Shapes for Sharing between Graph Data Spaces - and Epistemic Querying of RDF-...
Programming's Greatest Hits of the 60s and 70s
1. Programming`s
Greatest Hits of the
60s and 70s
Michelle Brush
Engineering Director, Cerner Corporation
Chapter Leader, Kansas City Girl Develop It
Conference Organizer, Midwest.io
5. Assuming
we
have
a
data
store
of
the
locations
of
all
bars
in
the
world…
https://www.flickr.com/photos/shutterrunner/4334879403/
“Today. The Green Door Tavern.” Shutter Runner CC BY 2.0
15. Everyone
used
to
know
binary
search.
They
just
didn’t
know
what
it
was
called.
(cc)
http://www.recyclethis.co.uk
(and picked inefficient pivot points)
145. Are all edge weights equal?
What’s your most expensive operation?
Do you have insights about your target?
Breadth
-First
Djikstra
A*
yes
no
visits
heuristics
?
?
?
146. breadth-first search f(x) = c
djikstra’s algorithm f(x) = g(x) + c
a* f(x) = g(x) + h(x) + c
The others were specializations.
177. public
class
EfficacyComparator
implements
Comparator<Choice>
public
class
CostComparator
implements
Comparator<Choice>
public
class
ConvenienceComparator
implements
Comparator<Choice>
1.SORT
2.TAKE
10
3.GOTO
1
178. public
class
EfficacyComparator
implements
Comparator<Choice>
public
class
CostComparator
implements
Comparator<Choice>
public
class
ConvenienceComparator
implements
Comparator<Choice>
1.SORT
2.TAKE
10
3.GOTO
1
181. for(int i = 0; i < count1; ++i) {
for(int j = 0; j < count2; ++j) {
for(int k = 0; k < count3; ++k) {
for(int l = 0; l < count4; ++l) {
for(int m = 0; m < count5; ++m) {
for(int n = 0; n < count6; ++n) {
for(int o = 0; o < count7; ++o)
for(int p = 0; p < count8; ++
for(int q = 0; q < count9;
for(int r = 0; r < coun
for(int s = 0; s < c
for(int t = 0; t
for(int u = 0;
for(int v =
for(int
for(i
fo
for-nado?