1456 search results - page 145 / 292 » Improved Randomized Results for That Interval Selection Prob... |
SODA
1994
ACM
15 years 11 days ago
1994
ACM
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
106
Voted
IAT
2009
IEEE
15 years 5 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
KI
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
90
Voted
IJCAI
2007
15 years 15 days ago
2007
A matrix formulation for an adaptive genetic algorithm is developed using mutation matrix and crossover matrix. Selection, mutation, and crossover are all parameter-free in the se...
AINA
2006
IEEE
15 years 5 months ago
2006
IEEE
We address the problem of automated video tracking of targets when targets undergo multiple mutual occlusions. Our approach is based on the idea that as targets are occluded, sele...