674 search results - page 68 / 135 » The computational complexity of the parallel knock-out probl... |
PODC
2003
ACM
15 years 6 months ago
2003
ACM
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
135
click to vote
ISVC
2010
Springer
14 years 12 months ago
2010
Springer
Large, multidimensional datasets are difficult to visualize and analyze. Visualization interfaces are constrained in resolution and dimension, so cluttering and problems of project...
102
click to vote
ISCAS
2005
IEEE
15 years 7 months ago
2005
IEEE
— Simulated Evolution (SimE) is a sound stochastic approximation algorithm based on the principles of adaptation. If properly engineered it is possible for SimE to reach nearopti...
JAL
2008
15 years 1 months ago
2008
Biological systems are far more complex and robust than systems we can engineer today. One way to increase the complexity and robustness of our engineered systems is to study how ...
116
click to vote
PODC
2010
ACM
15 years 5 months ago
2010
ACM
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...