Titlebook: Structural Information and Communication Complexity; 15th International C Alexander A. Shvartsman,Pascal Felber Conference proceedings 2008

影响

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

On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusionion on a ring of processors. In [BD95] 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

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

显微镜

Meander

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

大方一点

使人烦燥

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

MOAN

Grievance