5180 search results - page 286 / 1036 » Concurrency, Time, and Constraints |
199
Voted
SAINT
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we present an online algorithm that attacks the problem of placing relay nodes in regions where high localized congestion is detected. Congestion refers to the netwo...
150
click to vote
IAT
2006
IEEE
16 years 24 days ago
2006
IEEE
We present a new approach to distributed problem solving based on high-level program execution. While this technique has proven itself for single-agent systems based on the Golog ...
162
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
By using a macro/micro state model we show how assumptions on the resolution of logical and physical timing of computation in computer systems has resulted in design methodologies...
148
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
146
Voted
FLAIRS
2008
15 years 9 months ago
2008
In this paper we describe a class of a problem of goal satisfaction in mutual exclusion network that can be solved in polynomial time. This problem provides a common basis for rea...