1921 search results - page 186 / 385 » Making AC-3 an Optimal Algorithm |
137
click to vote
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
154
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
142
Voted
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
116
click to vote
TPDS
2008
15 years 2 months ago
2008
Energy usage has been an important concern in recent research on online job scheduling, where processors are allowed to vary the speed dynamically so as to save energy whenever pos...
126
Voted
GRAMMARS
2002
15 years 2 months ago
2002
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...