1603 search results - page 111 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
157
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
Abstract— Many asynchronous designs are naturally specified and implemented hierarchically as an interconnection of separate asynchronous modules that operate concurrently and c...
154
click to vote
ICONIP
2007
15 years 7 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
168
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
191
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
167
click to vote
AUTOMATICA
2007
15 years 6 months ago
2007
Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs with a parameter in the cost, or equivalently the right-...