Walmart Oct 2011 - Apr 2013
Enterprise Architect - Enterprise Information Architecture
Nimbus Bi Oct 2011 - Apr 2013
Founder and Chief Executive Officer
Teradata 1988 - 2008
Senior Solution Architect and Project Manager
Education:
Maryville University of Saint Louis
Skills:
Business Intelligence Information Architecture Data Warehousing Analytics Saas Teradata Enterprise Architecture Big Data Cloud Computing Enterprise Software Strategy Sdlc Management E Commerce Professional Services Data Integration Data Modeling Solution Architecture Etl It Strategy Master Data Management Business Analysis Database Design Databases
Interests:
Sunsets at the Beach Boating Virtual Data Warehousing Ecommerce Bi and Advanced Analytics My Life Interests Include Investing In Memory Data Grids Fishing
Gabriel Castillo (1968-1972), MIchelle Maynard (1985-1989), Kayla Clayton (1967-1971), Mike Gale (1988-1992), Roy Bellman (1965-1969)
Googleplus
Roy Bellman
Lived:
Pevely, MO St. Louis, MO Redondo Beach, CA Sacramento, CA Seal Beach, CA Chicago, IL
Work:
NIMBUS BI INC - CEO Teradata Corporation Computer Sciences Corporation
Education:
Maryville University, St. Louis, MO, University of Maryland, Saigon, Vietnam, Southern Illinois University, Edwardsville, IL, Washingtopn University, St. Louis, MO
Roy Bellman
Tagline:
Nash Man
Youtube
Bellman-Ford Algorithm Single Source Shortest...
Time complexity is O(EV) Space complexity is O(V) Bellman-Ford works w...
Duration:
21m 32s
Algorithme de Bellman Ford et les poids ngatifs
Prsentation, de manire simplifie et illustre, l'algorithme de Bellman-...
Duration:
11m 22s
Bellman-Ford in 5 minutes Step by step example
Step by step instructions showing how to run Bellman-Ford on a graph. ...
Duration:
5m 10s
4.4 Bellman Ford Algorithm - Single Source Sh...
Bellman Ford Single Source Shortest Path Dynamic Programming Drawbacks...
Duration:
17m 12s
Bellman Equation Basics for Reinforcement Lea...
An introduction to the Bellman Equations for Reinforcement Learning. P...
Duration:
13m 50s
Traveling Salesman Problem Dynamic Programmin...
Held Karp designed this algorithm. Time complexity is O(2n*n*n)