Sciweavers

120 search results - page 21 / 24
» The Weak Mutual Exclusion problem
Sort
View
COMPGEOM
1994
ACM
13 years 11 months ago
Competitive Searching in a Generalized Street
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...
Amitava Datta, Christian Icking
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
14 years 4 months ago
Faster SAT and Smaller BDDs via Common Function Structure
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...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
14 years 1 months ago
An improved restricted growth function genetic algorithm for the consensus clustering of retinal nerve fibre data
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...
Stephen Swift, Allan Tucker, Jason Crampton, David...
PODC
2005
ACM
14 years 1 months ago
Quorum placement in networks to minimize access delays
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...
Anupam Gupta, Bruce M. Maggs, Florian Oprea, Micha...
SPW
2004
Springer
14 years 24 days ago
One User, Many Hats; and, Sometimes, No Hat: Towards a Secure Yet Usable PDA
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 ...
Frank Stajano