16404 search results - page 802 / 3281 » A set coverage problem |
206
click to vote
DAGSTUHL
2006
15 years 9 months ago
2006
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs Cay(G, S). The problem is stated as the problem of reconstructing a vertex from the mi...
221
click to vote
CSC
2009
15 years 8 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
258
click to vote
ASC
2007
15 years 7 months ago
2007
Most real world engineering design optimisation approaches reported in the literature aim to find the best set of solutions using computationally expensive quantitative (QT ) mode...
220
click to vote
DAM
2008
15 years 7 months ago
2008
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
164
click to vote
EOR
2008
15 years 7 months ago
2008
Abstract. Portfolios of assets whose returns have the Gaussian mixture distribution are optimized in the static setting to find portfolio weights and efficient frontiers using the ...