14548 search results - page 231 / 2910 » The Optimal Path-Matching Problem |
152
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...
120
click to vote
CEC
2008
IEEE
15 years 9 months ago
2008
IEEE
—As more and more real-world optimization problems become increasingly complex, algorithms with more capable optimizations are also increasing in demand. For solving large scale ...
114
Voted
GLOBECOM
2010
IEEE
15 years 14 days ago
2010
IEEE
In this paper, we investigate the maximization of the amount of gathered data in a clustered wireless sensor network (WSN). The amount of gathered data is maximized by (1) choosing...
133
Voted
FOCS
2005
IEEE
15 years 8 months ago
2005
IEEE
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
119
click to vote
ACTA
1998
15 years 2 months ago
1998
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...