José Luis Montaña

According to our database1, José Luis Montaña authored at least 49 papers between 1992 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
A Method for Analyzing the Quality-in-Use in Collaborative Contexts.
Proceedings of the XX International Conference on Human Computer Interaction, 2019

2018
Global optimality in k-means clustering.
Inf. Sci., 2018

Discovering User's Trends and Routines from Location Based Social Networks.
Proceedings of the 12th International Conference on Ubiquitous Computing and Ambient Intelligence, 2018

2017
User Interaction Modeling and Profile Extraction in Interactive Systems: A Groupware Application Case Study.
Sensors, 2017

Classification of Alzheimer's Patients through Ubiquitous Computing.
Sensors, 2017

Reports on the 2017 AAAI Spring Symposium Series.
AI Magazine, 2017

Daily Routines Inference Based on Location History.
Proceedings of the Ubiquitous Computing and Ambient Intelligence, 2017

Neural Networks in Autonomous Driving.
Proceedings of the 2017 AAAI Spring Symposia, 2017

2016
Behavioral Modeling Based on Probabilistic Finite Automata: An Empirical Study.
Sensors, 2016

Quiz games as a model for information hiding.
J. Complexity, 2016

Model-driven regularization approach to straight line program genetic programming.
Expert Syst. Appl., 2016

Automatic Generation of User Interaction Models.
Proceedings of the Ubiquitous Computing and Ambient Intelligence, 2016

Detecting Human Movement Patterns Through Data Provided by Accelerometers. A Case Study Regarding Alzheimer's Disease.
Proceedings of the Ubiquitous Computing and Ambient Intelligence, 2016

2015
Teaching a Virtual Robot to Perform Tasks by Learning from Observation.
Proceedings of the Ubiquitous Computing and Ambient Intelligence. Sensing, Processing, and Using Environmental Information, 2015

2014
A Dynamic-Bayesian Network framework for modeling and evaluating learning from observation.
Expert Syst. Appl., 2014

A Sharp Fitness Function for the Problem of Finding Roots of Polynomial Equations Systems.
Proceedings of the ECTA 2014, 2014

2013
Model Complexity Control in Straight Line Program Genetic Programming.
Proceedings of the IJCCI 2013, 2013

A Dynamic Bayesian Network Framework for Learning from Observation.
Proceedings of the Advances in Artificial Intelligence, 2013

2011
Penalty Functions for Genetic Programming Algorithms.
Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

2010
The Role of Keeping "Semantic Blocks" Invariant - Effects in Linear Genetic Programming Performance.
Proceedings of the ICEC 2010 - Proceedings of the International Conference on Evolutionary Computation, [part of the International Joint Conference on Computational Intelligence IJCCI 2010], Valencia, Spain, October 24, 2010

Coevolutionary Architectures with Straight Line Programs for Solving the Symbolic Regression Problem.
Proceedings of the ICEC 2010 - Proceedings of the International Conference on Evolutionary Computation, [part of the International Joint Conference on Computational Intelligence IJCCI 2010], Valencia, Spain, October 24, 2010

Model Regularization in Coevolutionary Architectures Evolving Straight Line Code.
Proceedings of the Computational Intelligence, 2010

Model selection in genetic programming.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

2009
A New Linear Genetic Programming Approach Based on Straight Line Programs: Some Theoretical and Experimental Aspects.
International Journal on Artificial Intelligence Tools, 2009

On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations.
Ann. Math. Artif. Intell., 2009

Lower Bounds for Approximation of Some Classes of Lebesgue Measurable Functions by Sigmoidal Neural Networks.
Proceedings of the Bio-Inspired Systems: Computational and Ambient Intelligence, 2009

Evolution Strategies for Constants Optimization in Genetic Programming.
Proceedings of the ICTAI 2009, 2009

Adaptation, Performance and Vapnik-Chervonenkis Dimension of Straight Line Programs.
Proceedings of the Genetic Programming, 12th European Conference, 2009

2008
Straight Line Programs: A New Linear Genetic Programming Approach.
Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), 2008

Computing Surrogate Constraints for Multidimensional Knapsack Problems Using Evolution Strategies.
Proceedings of the Applications of Evolutionary Computing, 2008

VCD Bounds for some GP Genotypes.
Proceedings of the ECAI 2008, 2008

VC Dimension Bounds for Analytic Algebraic Computations.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
A Word Equation Solver Based on Levensthein Distance.
Proceedings of the MICAI 2007: Advances in Artificial Intelligence, 2007

Finiteness Properties of Some Families of GP-Trees.
Proceedings of the Current Topics in Artificial Intelligence, 2007

Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations.
Proceedings of the Algorithmic Learning Theory, 18th International Conference, 2007

2005
On the Number of Random Digits Required in MonteCarlo Integration of Definable Functions.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

An Evolutionary Strategy for the Multidimensional 0-1 Knapsack Problem Based on Genetic Computation of Surrogate Multipliers.
Proceedings of the Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach: First International Work-Conference on the Interplay Between Natural and Artificial Computation, 2005

A Flipping Local Search Genetic Algorithm for the Multidimensional 0-1 Knapsack Problem.
Proceedings of the Current Topics in Artificial Intelligence, 2005

2004
Word Equation Systems: The Heuristic Approach.
Proceedings of the Advances in Artificial Intelligence - SBIA 2004, 17th Brazilian Symposium on Artificial Intelligence, São Luis, Maranhão, Brazil, September 29, 2004

2003
An Evolutionary Algorithm for Solving Word Equation Systems.
Proceedings of the Current Topics in Artificial Intelligence, 2003

2002
The Distribution of Condition Numbers of Rational Data of Bounded Bit Length.
Foundations of Computational Mathematics, 2002

2001
A new method to obtain lower bounds for polynomial evaluation.
Theor. Comput. Sci., 2001

2000
Time-Space Tradeoffs in Algebraic Complexity Theory.
J. Complexity, 2000

1998
On Kolmogorov Complexity in the Real Turing Machine Setting.
Inf. Process. Lett., 1998

Combinatorial Hardness Proofs for Polynomial Evaluation.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1995
Lower bounds for arithmetic networks II: Sum of Betti numbers.
Appl. Algebra Eng. Commun. Comput., 1995

1994
A Note on Rabin's Width of a Complete Proof.
Computational Complexity, 1994

1993
Lower Bounds for Arithmetic Networks.
Appl. Algebra Eng. Commun. Comput., 1993

1992
Time Bounded Computations over the Reals.
IJAC, 1992


  Loading...