14078 search results - page 229 / 2816 » Design and Analysis of Computer Algorithms |
154
click to vote
COMPGEOM
2004
ACM
16 years 5 hour ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
168
click to vote
NIPS
2003
15 years 8 months ago
2003
In applying Hidden Markov Models to the analysis of massive data streams, it is often necessary to use an artificially reduced set of states; this is due in large part to the fac...
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
181
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
In this paper, the Quantum-inspired Genetic Algorithms with the population of a single individual are formalized by a Markov chain model using a single and the stored best individ...
183
click to vote
SBACPAD
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper presents a theoretical study to evaluate the performance of a family of parallel implementations of the propagation algorithm. The propagation algorithm is used to an i...