120 search results - page 21 / 24 » The Weak Mutual Exclusion problem |
COMPGEOM
1994
ACM
15 years 1 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
109
click to vote
ICCAD
2001
IEEE
15 years 6 months ago
2001
IEEE
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
This paper describes an extension to the Restricted Growth Function grouping Genetic Algorithm applied to the Consensus Clustering of a retinal nerve fibre layer data-set. Consens...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of n...
106
Voted
SPW
2004
Springer
15 years 3 months ago
2004
Springer
How can we design a PDA that is at the same time secure and usable? In current implementations the two properties are mutually exclusive. Because normal users find password entry ...