3946 search results - page 197 / 790 » The computational complexity of choice sets |
195
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
171
click to vote
STTT
2008
15 years 6 months ago
2008
Abstract. Fast is a tool for the analysis of systems manipulating unbounded integer variables. We check safety properties by computing the reachability set of the system under stud...
302
click to vote
SEMCCO
2010
15 years 4 months ago
2010
Differential Evolution (DE) has attracted much attention recently as an effective approach for solving numerical optimization problems. However, the performance of DE is sensitive ...
160
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
317
click to vote
CONCURRENCY
2002
15 years 6 months ago
2002
: The accelerated development in Peer-to-Peer (P2P) and Grid computing has positioned them as promising next generation computing platforms. They enable the creation of Virtual Ent...