3096 search results - page 195 / 620 » Theory and Use of the EM Algorithm |
150
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
170
click to vote
COMPGEOM
1995
ACM
15 years 9 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
135
click to vote
ATAL
2009
Springer
16 years 23 days ago
2009
Springer
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...
153
click to vote
SAC
1998
ACM
15 years 10 months ago
1998
ACM
The fast messy genetic algorithm (fmGA) belongs to a class of algorithms inspired by the principles of evolution, known appropriately as "evolutionary algorithms" (EAs)....
178
click to vote
CG
2005
Springer
15 years 6 months ago
2005
Springer
A new algorithm for Boolean operations on general planar polygons is presented. It is available for general planar polygons (manifold or non-manifold, with or without holes). Edge...