Sciweavers

4940 search results - page 113 / 988
» On the Complexity of Universal Programs
Sort
View
GECCO
2005
Springer
121views Optimization» more  GECCO 2005»
15 years 10 months ago
New evolutionary techniques for test-program generation for complex microprocessor cores
Checking if microprocessor cores are fully functional at the end of the productive process has become a major issue. Traditional functional approaches are not sufficient when cons...
Ernesto Sánchez, Massimiliano Schillaci, Ma...
164
Voted
JMLR
2012
13 years 7 months ago
Sample Complexity of Composite Likelihood
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...
Joseph K. Bradley, Carlos Guestrin
BIRTHDAY
2000
Springer
15 years 9 months ago
Niklaus Wirth - a Pioneer of Computer Science
Niklaus Wirth is one of the most influential scientists of the early computer age. His ideas and especially his programming languages have shaped generations of programmers worldw...
Gustav Pomberger, Hanspeter Mössenböck, ...
130
Voted
GCA
2007
15 years 6 months ago
Grid Computing in an Academic Environment
This paper describes an investigation into the provision of grid computing facilities in a typical university environment. In particular, it focuses on the use of the Java programm...
George Wells, Gregory Atkinson
IJBC
2007
39views more  IJBC 2007»
15 years 4 months ago
Optimal CNN Templates for Linearly-Separable One-Dimensional Cellular Automata
In this tutorial, we present optimal Cellular Nonlinear Network (CNN) templates for implementing linearly-separable one-dimensional (1-D) Cellular Automata (CA). From the gallery ...
P. J. Chang, Bharathwaj Muthuswamy