2084 search results - page 191 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
JC
2006
15 years 2 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
125
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
128
Voted
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
121
Voted
HPCC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Energy consumption is a major factor that limits the performance of sensor applications. Sensor nodes have varying sampling rates since they face continuously changing en...
127
Voted
DRR
2010
15 years 5 months ago
2010
Scaling up document-image classifiers to handle an unlimited variety of document and image types poses serious challenges to conventional trainable classifier technologies. Highly...