Sciweavers

1618 search results - page 120 / 324
» Testing random number generators
Sort
View
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
14 years 2 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
AI
2009
Springer
14 years 4 months ago
Novice-Friendly Natural Language Generation Template Authoring Environment
Abstract. Natural Language Generation (NLG) systems can make data accessible in an easily digestible textual form; but using such systems requires sophisticated linguistic and some...
Maria Fernanda Caropreso, Diana Inkpen, Shahzad Kh...
EPIA
2007
Springer
14 years 4 months ago
A Genetic Programming Approach to the Generation of Hyper-Heuristics for the Uncapacitated Examination Timetabling Problem
Research in the field of examination timetabling has developed in two directions. The first looks at applying various methodologies to induce examination timetables. The second tak...
Nelishia Pillay, Wolfgang Banzhaf
FLAIRS
2004
13 years 11 months ago
Automatic Generation of Background Text to Aid Classification
We illustrate that Web searches can often be utilized to generate background text for use with text classification. This is the case because there are frequently many pages on the...
Sarah Zelikovitz, Robert Hafner
IJCNN
2008
IEEE
14 years 4 months ago
Dataset complexity can help to generate accurate ensembles of k-nearest neighbors
— Gene expression based cancer classification using classifier ensembles is the main focus of this work. A new ensemble method is proposed that combines predictions of a small ...
Oleg Okun, Giorgio Valentini