ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For packets sent at discrete times over an unreliable medium, with node i succeeding independently with probability p_i and requiring throughput q_i per unit time, characterize exactly which tuples (p_i,q_i)_{i=1}^{N} and deadline period T are feasible. For the associated autonomous-traffic system of communicating unicycle cars on multi-lane roads, design controls that guarantee no collisions, no road departures, and safe traversal of intersections.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.