blocks|key|2413529|text|也许会改进电脑的对手呢？|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2413530|(游戏)|offset|length|2413531|entityMap|0|LINK|mutability|MUTABLE|url|http://en.wikipedia.org/wiki/Go_(game)^0|0|0|4|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|O|8|@]|9|@$D|P|E|Q|1|R]]|A|$]]|$1|F|3|-4|5|6|7|S|8|@]|9|@]|A|$]]]|G|$H|$5|I|J|K|A|$L|M]]]]

Perhaps improve computer opponents for Go?

<a href="http://en.wikipedia.org/wiki/Go_(game)" rel="nofollow noreferrer">http://en.wikipedia.org/wiki/Go_(game)</a>

blocks|key|974696|text|一个使用mapreduce的决策过程如何，并且每次选择答案的效率更高？|type|unstyled|depth|inlineStyleRanges|entityRanges|data|974697|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

How about a decision process that uses mapreduce, and gets more efficient at choosing the answer each time?

blocks|key|887542|text|那么参加NetFlix比赛呢？|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|887543|entityMap|0|LINK|mutability|MUTABLE|url|http://www.netflixprize.com/^0|4|7|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

And what about participating in <a href="http://www.netflixprize.com/" rel="nofollow noreferrer">NetFlix</a> competition?

blocks|key|975397|text|桔黄色的是一个全面的数据挖掘和机器学习套件，以Python和可视化编程为特色。也许你也分发了：)|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|975398|entityMap|0|LINK|mutability|MUTABLE|url|http://www.ailab.si/orange/^0|0|4|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

<a href="http://www.ailab.si/orange/" rel="nofollow noreferrer">Orange</a> is an comprehensive data mining and machine learing suite featuring Python scripting and visual programming. Maybe you too distributed it:)

blocks|key|974763|text|我需要某种工具来观察自动化系统的行为(例如，过程控制系统)，并且能够找出哪些输入是随后发生的，然后从它导出某种模型，然后作为真实系统的模拟。它不完全是分布式的，但是它的工程:-)|type|unstyled|depth|inlineStyleRanges|entityRanges|data|974764|另一方面，我们的代码是用java编写的(尽管您可以使用jython+)。|974765|如果你感兴趣，寄给我一封邮件(朱尔根·多特在inavare+DOT网上升)。|974766|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|I|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|J|8|@]|9|@]|A|$]]|$1|F|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|G|$]]

I need some kind of tool which observes the behaviour of a automation system (for instance a process control system), and is able to figure out on which inputs which actions follow, and then derives some kind of model from it which would then be usable as a simulation of the real system. It's not exactly distributed, but its engineering :-)

On the other hand, our code is written in java (although you could use jython instead).

If you are interested, drop me a mail (juergen DOT rose AT inavare DOT net).

blocks|key|974730|text|如果围棋看起来很复杂，你也可以试试连续五次电脑的对手。(维基百科用棋子来做这件事，但我更习惯用抽搐脚趾的数字和十字。)|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|974731|entityMap|0|LINK|mutability|MUTABLE|url|http://en.wikipedia.org/wiki/Five_in_a_Row_(game)^0|H|4|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

If GO seems to complicated, you could also try a <a href="http://en.wikipedia.org/wiki/Five_in_a_Row_(game)" rel="nofollow noreferrer">five in a row</a> computer opponent. (Wikipedia does this with GO-pieces, but I'm more used to the tic-tac-toe noughts and crosses.)

blocks|key|2413627|text|侵入一个P2P协议并实现一些有用的东西怎么样？我为P2P流量设计了一个代理缓存实现。基本上，为P2P流量设计并实现了代理缓存。它将与网络文件/对象不同，因为：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2413628|1-+P2P对象是不变的。您可能需要一个网页不止一次，但您确实下载了一个P2P对象(例如，电影)，并从您的办公桌多次阅读。|2413629|2-与web对象相比，P2P对象是巨大的(高达几千兆字节)，因此您需要部分缓存一些对象，并实现某种智能的准入/驱逐策略。|2413630|3-+P2P对象具有不同的流行度。仅仅因为缓存中有东西，并不意味着它应该永远留在缓存中，因为它的受欢迎程度会下降(也就是说，一旦一部电影发行，它就很受欢迎，下载了很多，然后就会下降，大家都会忘记它)，所以你不能仅仅依靠最近的时间或频率作为唯一的替代策略。|2413631|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|J|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|K|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|L|8|@]|9|@]|A|$]]|$1|F|3|G|5|6|7|M|8|@]|9|@]|A|$]]|$1|H|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|I|$]]

How about hacking a P2P protocol and implementing something useful? I worked on a proxy cache implementation for P2P traffic. Basically, design and implement a proxy cache for P2P traffic. It will be different from web documents/objects in that:

1- P2P objects are immutable. You might request a web-page more than once, but you really download a P2P object (e.g., movie) once and read it from your desk multiple times.

2- P2P objects are huge compared to web objects (up to few Gigabytes) so you'll need to cache some objects partially, and implement some kind of smart admission/eviction policy.

3- P2P objects have different popularity. Just because something is in the cache does not mean it should stay in the cache forever, because its popularity will degrade (i.e., once a movie is released it is very popular, downloaded a lot, then it drops and everybody forgets about it), so you can't rely on recency or frequency alone as the only replacement policy.

I require to do a project as a part of my final year of engineering graduation studies.Can you suggest some projects pertaining to distributed systems and artificial intelligence together and which require python,c or c++ for programming?
Note:-Please suggest a project that is attainable for a group of 2 students.

Graduation Project

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我需要做一个项目作为我最后一年工程毕业的一部分studies.Can你建议一些与分布式系统和人工智能相关的项目，这些项目需要python、c或c++来编程？注：

问毕业设计
EN

回答 7

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问毕业设计EN

回答 7

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问毕业设计
EN