Sciweavers

1086 search results - page 146 / 218
» Programming by Numbers: A Programming Method for Novices
Sort
View
127
Voted
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 6 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
97
Voted
PLILP
1993
Springer
15 years 6 months ago
Higher-Order Chaotic Iteration Sequences
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
Mads Rosendahl
126
Voted
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 6 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
117
Voted
NIPS
2003
15 years 3 months ago
Inferring State Sequences for Non-linear Systems with Embedded Hidden Markov Models
We describe a Markov chain method for sampling from the distribution of the hidden state sequence in a non-linear dynamical system, given a sequence of observations. This method u...
Radford M. Neal, Matthew J. Beal, Sam T. Roweis
137
Voted
CEC
2010
IEEE
15 years 3 months ago
Improving GP classification performance by injection of decision trees
This paper presents a novel hybrid method combining genetic programming and decision tree learning. The method starts by estimating a benchmark level of reasonable accuracy, based ...
Rikard König, Ulf Johansson, Tuve Löfstr...