Presentation is loading. Please wait.

Presentation is loading. Please wait.

ORF 401 - Electronic Commerce Spring 2012 Week 1 16 1 1 1 2 2 2 3 3 3 4 3 55 6 6 8 8 9 6 PROBLEM: How “best” to get from A to B Many Paths, Each with a.

Similar presentations


Presentation on theme: "ORF 401 - Electronic Commerce Spring 2012 Week 1 16 1 1 1 2 2 2 3 3 3 4 3 55 6 6 8 8 9 6 PROBLEM: How “best” to get from A to B Many Paths, Each with a."— Presentation transcript:

1 ORF 401 - Electronic Commerce Spring 2012 Week 1 16 1 1 1 2 2 2 3 3 3 4 3 55 6 6 8 8 9 6 PROBLEM: How “best” to get from A to B Many Paths, Each with a Different Value to the Decision Maker Network attributes are stochastic: Expected Utilites (travel times, opportunities,…) 4 Navigation-based Commerce, (nCommerce)

2 ORF 401 - Electronic Commerce Spring 2012 Week 1 Finally… Convergence of GPS Real-Time Decisions that substantially improve QoL (Quality of Live) & RoI (Return on Investment) & Memory Real-Time “Mission-critical” Mobile Information past,present & future (dynamic plan) & Wireless nCommerce & & Robust OS

3 ORF 401 - Electronic Commerce Spring 2012 nCommerce– Mobile Advertising Platform CoPilot Live knows your… –Current Location –Destination –Route Along the way – –Local Search –Points of Interest –Businesses –Traffic –Weather


Download ppt "ORF 401 - Electronic Commerce Spring 2012 Week 1 16 1 1 1 2 2 2 3 3 3 4 3 55 6 6 8 8 9 6 PROBLEM: How “best” to get from A to B Many Paths, Each with a."

Similar presentations


Ads by Google