1603 search results - page 179 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
160
click to vote
IPCO
2001
15 years 8 months ago
2001
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
180
click to vote
PVLDB
2008
15 years 6 months ago
2008
Unlike traditional database queries, keyword queries do not adhere to predefined syntax and are often dirty with irrelevant words from natural languages. This makes accurate and e...
219
click to vote
COMGEO
2012
ACM
14 years 2 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
157
click to vote
SIGECOM
2006
ACM
16 years 14 days ago
2006
ACM
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
174
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—In wireless networks, how to select transmit power that maximizes throughput is a challenging problem. On one hand, transmissions at a high power level could increase interferen...