Sciweavers

7930 search results - page 1232 / 1586
» Greedy in Approximation Algorithms
Sort
View
UAI
1998
15 years 8 months ago
Structured Reachability Analysis for Markov Decision Processes
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
Craig Boutilier, Ronen I. Brafman, Christopher W. ...
SIROCCO
1997
15 years 8 months ago
Static Frequency Assignment in Cellular Networks
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
Lata Narayanan, Sunil M. Shende
GECCO
2008
Springer
172views Optimization» more  GECCO 2008»
15 years 7 months ago
Recursive least squares and quadratic prediction in continuous multistep problems
XCS with computed prediction, namely XCSF, has been recently extended in several ways. In particular, a novel prediction update algorithm based on recursive least squares and the ...
Daniele Loiacono, Pier Luca Lanzi
SMA
2010
ACM
181views Solid Modeling» more  SMA 2010»
15 years 6 months ago
Merging and smoothing machining boundaries on cutter location surfaces
In region machining, neighbouring regions may be close together, but disconnected. Boundary curves may also have unwanted geometric artifacts caused by approximation and discretis...
Weishi Li, Ralph R. Martin, Frank C. Langbein
CGF
2008
192views more  CGF 2008»
15 years 6 months ago
Non-Rigid Registration Under Isometric Deformations
We present a robust and efficient algorithm for the pairwise non-rigid registration of partially overlapping 3D surfaces. Our approach treats non-rigid registration as an optimiza...
Qi-Xing Huang, Bart Adams, Martin Wicke, Leonidas ...
« Prev « First page 1232 / 1586 Last » Next »