1603 search results - page 158 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
206
click to vote
JBI
2004
15 years 8 months ago
2004
Microarray analysis using clustering algorithms can suffer from lack of inter-method consistency in assigning related gene-expression profiles to clusters. Obtaining a consensus s...
193
click to vote
CN
2006
15 years 6 months ago
2006
In this paper, we address the server selection problem for streaming applications on the Internet. The architecture we consider is similar to the content distribution networks con...
195
click to vote
CSC
2009
15 years 7 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...
220
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
Abstract—Network power consumption can be reduced considerably by adapting link data rates to their offered traffic loads. In this paper, we exploit how to leverage rate adaptat...
147
click to vote
ANSS
1998
IEEE
15 years 10 months ago
1998
IEEE
In solving application problems, the data sets used to train a neural network may not be hundred percent precise but within certain ranges. Representing data sets with intervals, ...