2027 search results - page 264 / 406 » When is it best to best-respond |
140
click to vote
COMGEO
2008
ACM
15 years 1 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
CORR
2008
Springer
15 years 1 months ago
2008
Springer
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In many real-world scenarios, it is nearly impossible to collect explicit social network data. In such cases, whole networks must be inferred from underlying observations. Here, w...