1603 search results - page 172 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
171
click to vote
ICCAD
1997
IEEE
15 years 10 months ago
1997
IEEE
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...
337
click to vote
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
182
click to vote
WINE
2009
Springer
16 years 1 months ago
2009
Springer
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...
155
click to vote
AI
2006
Springer
15 years 6 months ago
2006
Springer
In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which multiple users have distinct preferences. However, making su...
175
click to vote
RTCSA
2008
IEEE
16 years 27 days ago
2008
IEEE
Cache partitioning techniques have been proposed in the past as a solution for the cache interference problem. Due to qualitative differences with general purpose platforms, real-...