Sciweavers

3653 search results - page 503 / 731
» On Recognizable Timed Languages
Sort
View
GECCO
2008
Springer
133views Optimization» more  GECCO 2008»
15 years 7 months ago
Automatic generation of XSLT stylesheets using evolutionary algorithms
This paper introduces a procedure based on genetic programming to evolve XSLT programs (usually called stylesheets or logicsheets). XSLT is a general purpose, document-oriented fu...
Pablo García-Sánchez, Juan Juli&aacu...
BIRTHDAY
2010
Springer
15 years 6 months ago
Model Checking Programmable Router Configurations
Programmable networks offer the ability to customize router behaviour at run time, thus providing new levels of flexibility for network administrators. We have developed a program...
Luca Zanolin, Cecilia Mascolo, Wolfgang Emmerich
AIR
2010
96views more  AIR 2010»
15 years 6 months ago
Logic programming for combinatorial problems
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for...
Toshinori Munakata, Roman Barták
COGSCI
2010
160views more  COGSCI 2010»
15 years 6 months ago
Comprehension of Simple Quantifiers: Empirical Evaluation of a Computational Model
We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same pr...
Jakub Szymanik, Marcin Zajenkowski
CORR
2010
Springer
95views Education» more  CORR 2010»
15 years 6 months ago
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
Frédérique Bassino, Mathilde Bouvel,...