6142 search results - page 440 / 1229 » The Complexity of Partition Functions |
151
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Particle Swarm Optimization (PSO) is a population-based optimization method in which search points employ a cooperative strategy to move toward one another. In this paper we show ...
165
click to vote
IEE
2002
15 years 6 months ago
2002
: Software practitioners recognise the importance of realistic estimates of effort for the successful management of software projects, the Web being no exception. Estimates are nec...
183
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
174
click to vote
TCC
2010
Springer
16 years 3 months ago
2010
Springer
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “ful...
188
click to vote
ECBS
2007
IEEE
16 years 1 months ago
2007
IEEE
The ever growing size and complexity of both technical and business systems requires efficient software engineering approaches to keep development cost under control while still ...