216 search results - page 42 / 44 » On the number of minima of a random polynomial |
GECCO
2010
Springer
14 years 12 days ago
2010
Springer
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
SPAA
2004
ACM
14 years 1 months ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...