1647 search results - page 186 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
158
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
126
Voted
CEC
2007
IEEE
15 years 11 months ago
2007
IEEE
— This study introduces the multi-criteria approach to the optimization of dynamic molecular alignment by shaped femtosecond laser pulses, which has been considered so far only a...
171
click to vote
TCOM
2010
15 years 3 months ago
2010
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
134
click to vote
ICIP
2003
IEEE
16 years 6 months ago
2003
IEEE
In this paper the blind image deconvolution (BID) problem is solved using the Bayesian framework. In order to find the parameters of the proposed Bayesian model we present a new g...
180
Voted
PARA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...