207 search results - page 25 / 42 » Smoothed analysis of integer programming |
126
click to vote
JMLR
2012
13 years 1 days ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
MONET
2008
14 years 9 months ago
2008
Wireless networks that operate on batteries are imposed with energy constraints and long distance communications between nodes are not desirable. Implementing Relay Nodes (RNs) can...
SIGMOD
2012
ACM
13 years 1 days ago
2012
ACM
How-To queries answer fundamental data analysis questions of the form: “How should the input change in order to achieve the desired output”. As a Reverse Data Management probl...
MBEES
2010
14 years 11 months ago
2010
: Integrating architectural elements with a modern programming language is essential to ensure a smooth combination of architectural design and programming. In this position statem...
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
With the increasing gap between processor speed and memory latency, the performance of data-dominated programs are becoming more reliant on fast data access, which can be improved...