没有合适的资源?快使用搜索试试~ 我知道了~
course_description.pdf
1.该资源内容由用户上传,如若侵权请联系客服进行举报
2.虚拟产品一经售出概不退款(资源遇到问题,请及时私信上传者)
2.虚拟产品一经售出概不退款(资源遇到问题,请及时私信上传者)
版权申诉
0 下载量 57 浏览量
2023-06-18
13:11:45
上传
评论
收藏 25KB PDF 举报
温馨提示
试读
2页
course_description.pdf
资源推荐
资源详情
资源评论
Algorithms for Science Applica tions II
ISC 4221
Spring 2011
Instructors: Professor Janet Peterson Dr. John Burkardt
email: jpeterson@fsu.edu email: jburkardt@fsu.edu
office: 444 DSL office: 445 DSL
phone: 644-1979 phone:
Office Hours: M 12:15-1:15 p.m.
F 11-12 a.m.
TA: Olmo Zavala-Romero office: 492E DSL
email: osz09@fsu.edu office hours:
Class: MWF 12:20-1:10 152 DSL
Lab: T 3:30-6 p.m., 152 DSL
Prerequisites: Calculus I and II
Website: Blackboard
Text: None required; see reading list
Course Description: This course provides the student with an introduction to algo-
rithms used for solving discrete problems such as sorting or searching a n array, scheduling,
determining an o ptimal path (such as the well-know n traveling salesman problem), ex-
tracting and interpreting data, etc. In addition to introducing the student to common
algorithms for various problems, this course also provides the student with tools to ana-
lyze algorithms so that a lgorithms which solve the same problem can be compared. The
course is divided into eight parts:
• Part I - Introduction to Algorithm Design and Analysis (Peterson)
• Part II - Random Processes (Peterson)
• Part III - Graph Theory (Burkardt)
• Part IV - Data Mining (Peterson)
• Part V - Clustering (Peterson)
• Part VI - Optimization (Peterson)
• Part VII - Feature Extraction and Pattern Recognition (Burkardt)
• Part VIII - Computational Geometry (Burkardt)
1
资源评论
卷积神经网络
- 粉丝: 342
- 资源: 8460
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功