13987 search results - page 679 / 2798 » The Two Guards Problem |
206
click to vote
IEICET
2007
15 years 7 months ago
2007
—When SA is applied to continuous optimization problems, the design of the neighborhood used in SA becomes important. A lot of experiments are necessary to determine an appropria...
194
click to vote
INFOCOM
2010
IEEE
15 years 6 months ago
2010
IEEE
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
193
click to vote
CDC
2010
IEEE
15 years 2 months ago
2010
IEEE
In this paper we deal with two problems which are of great interest in the field of distributed decision making and control. The first problem we tackle is the problem of achieving...
227
click to vote
TSMC
2011
15 years 2 months ago
2011
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
173
click to vote
TIT
2010
15 years 2 months ago
2010
The joint-sparse recovery problem aims to recover, from sets of compressed measurements, unknown sparse matrices with nonzero entries restricted to a subset of rows. This is an ex...