2373 search results - page 59 / 475 » Complexities for generalized models of self-assembly |
132
Voted
ICMAS
2000
15 years 5 months ago
2000
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
179
click to vote
TEC
2002
15 years 3 months ago
2002
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
155
click to vote
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
162
click to vote
CCR
2006
15 years 4 months ago
2006
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
178
click to vote
SIAMCOMP
2010
15 years 2 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...