1291 search results - page 112 / 259 » Computing the multiplicity structure in solving polynomial s... |
180
Voted
FOCS
1993
IEEE
15 years 5 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
129
click to vote
JACM
2010
15 years 6 days ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
105
click to vote
FOCS
2009
IEEE
14 years 11 months ago
2009
IEEE
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
120
click to vote
ACL
1994
15 years 3 months ago
1994
We present an algorithm for computing n-gram probabilities from stochastic context-free grammars, a procedure that can alleviate some of the standard problems associated with n-gr...
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
This paper describes a multi-objective memetic approach for solving multi-objective flexible process sequencing problems in flexible manufacturing systems (FMSs). FMS can be des...