4430 search results - page 98 / 886 » Solving Optimization Problems with DLL |
142
click to vote
CISS
2010
IEEE
14 years 6 months ago
2010
IEEE
— AHNs are wireless networks operating without the benefits of network infrastructure (basestations) or centralized control. AHNs working with limited spectrum perform best when...
157
click to vote
AAAI
2011
14 years 2 months ago
2011
Variable selection problems are typically addressed under a penalized optimization framework. Nonconvex penalties such as the minimax concave plus (MCP) and smoothly clipped absol...
139
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
122
click to vote
CVPR
2001
IEEE
16 years 5 months ago
2001
IEEE
We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of piece...
104
click to vote
ISVC
2007
Springer
15 years 9 months ago
2007
Springer
We formulate decomposition of two-dimensional shapes as a combinatorial optimization problem and present a dynamic programming algorithm that solves it.