110 search results - page 11 / 22 » New Upper Bounds for Maximum Satisfiability |
113
click to vote
CAAN
2007
Springer
15 years 3 months ago
2007
Springer
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
ICML
2008
IEEE
16 years 17 days ago
2008
IEEE
EM algorithm is a very popular iteration-based method to estimate the parameters of Gaussian Mixture Model from a large observation set. However, in most cases, EM algorithm is no...
140
click to vote
AAAI
2008
15 years 2 months ago
2008
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
128
click to vote
COMGEO
2011
ACM
14 years 6 months ago
2011
ACM
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
ICALP
2009
Springer
15 years 6 months ago
2009
Springer
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...