451 search results - page 35 / 91 » Simulated Annealing for Convex Optimization |
133
Voted
PIMRC
2008
IEEE
15 years 10 months ago
2008
IEEE
—We extend the existing network utility maximization (NUM) framework for wired networks to wireless sensor networks by formulating it in order to take into account interference a...
116
Voted
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
We present an efficient algorithm for solving the ray-shooting problem on high dimensional sets. Our algorithm computes the intersection of the boundary of a compact convex set w...
162
Voted
ICIP
2009
IEEE
16 years 4 months ago
2009
IEEE
Existing algorithms for surface reconstruction from point sets are defeated by moderate amounts of noise and outliers, which makes them unapplicable to point clouds originating fr...
152
Voted
DSD
2003
IEEE
15 years 9 months ago
2003
IEEE
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...
102
Voted
LAWEB
2003
IEEE
15 years 9 months ago
2003
IEEE
We perform a clustering of the Chilean Web Graph using a local fitness measure, optimized by simulated annealing, and compare the obtained cluster distribution to that of two mod...