影响 发表于 2025-3-25 03:19:54

Equal-Area Locus-Based Convex Polygon Decomposition points positioned arbitrarily inside ., the task is to divide . into . equal area convex parts, each containing exactly one point of .. The problem is motivated by a terrain covering task for a swarm of autonomous mobile robots. The algorithm runs in time .(.. + ..log.).

Indent 发表于 2025-3-25 09:09:45

On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusionion on a ring of processors. In a similar three state algorithm with an upper bound of . and a lower bound of . were presented for its stabilization time. For this later algorithm we prove an upper bound of ., and show a lower bound of .. − .(.).

outskirts 发表于 2025-3-25 11:41:43

978-3-540-69326-0Springer-Verlag Berlin Heidelberg 2008

显微镜 发表于 2025-3-25 17:34:49

http://reply.papertrans.cn/88/8800/879965/879965_24.png

Meander 发表于 2025-3-25 22:20:21

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/s/image/879965.jpg

大方一点 发表于 2025-3-26 00:22:42

http://reply.papertrans.cn/88/8800/879965/879965_26.png

使人烦燥 发表于 2025-3-26 05:25:08

Reputation, Trust and Recommendation Systems in Peer-to-Peer Systemspinion shaping, say). The flip side of this prospect, of course, is the danger that the system will deteriorate into a lawless jungle: some users in a peer-to-peer system, possibly coordinated, might exploit honest users to their advantage, since it appears that there is no effective way to enforce rules in this game.

Cubicle 发表于 2025-3-26 10:22:47

http://reply.papertrans.cn/88/8800/879965/879965_28.png

MOAN 发表于 2025-3-26 16:04:06

http://reply.papertrans.cn/88/8800/879965/879965_29.png

Grievance 发表于 2025-3-26 20:20:21

http://reply.papertrans.cn/88/8800/879965/879965_30.png
页: 1 2 [3] 4 5 6 7
查看完整版本: Titlebook: Structural Information and Communication Complexity; 15th International C Alexander A. Shvartsman,Pascal Felber Conference proceedings 2008