1603 search results - page 168 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
178
click to vote
TSP
2008
15 years 6 months ago
2008
Abstract--This paper addresses the problem of adaptively allocating the bits and the power among a set of parallel subchannels. A frame-oriented transmission with convolutional cod...
177
click to vote
BIS
2008
15 years 8 months ago
2008
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
159
click to vote
4OR
2010
15 years 6 months ago
2010
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
152
click to vote
CEC
2007
IEEE
16 years 26 days ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
195
click to vote
IAT
2009
IEEE
16 years 1 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....