128 search results - page 14 / 26 » Applying IC-Scheduling Theory to Familiar Classes of Computa... |
SIAMREV
2010
13 years 2 months ago
2010
The newly emerging field of Network Science deals with the tasks of modelling, comparing and summarizing large data sets that describe complex interactions. Because pairwise affin...
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
LICS
1998
IEEE
13 years 11 months ago
1998
IEEE
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
The World Summit on Sustainable Development (Johannesburg, 2002) encouraged the application of the ecosystem approach by 2010. However, at the same Summit, the signatory States un...