Emmanuel M. Tadjouddine

Affiliations:
  • University of Aberdeen, UK


According to our database1, Emmanuel M. Tadjouddine authored at least 23 papers between 1998 and 2017.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
A nonmonotone inexact Newton method for unconstrained optimization.
Optim. Lett., 2017

2016
Calibration based on entropy minimization for a class of asset pricing models.
Appl. Soft Comput., 2016

2015
A Dialectical Approach to Enable Decision Making in Online Trading.
Proceedings of the Multi-Agent Systems and Agreement Technologies, 2015

2014
Enabling Automatic Certification of Online Auctions.
Proceedings of the Proceedings 11th International Workshop on Formal Engineering approaches to Software Components and Architectures, 2014

Foundational Certification of Code Transformations Using Automatic Differentiation.
Comput. Sci., 2014

2013
A Proof-Carrying Code Approach to Certificate Auction Mechanisms.
Proceedings of the Formal Aspects of Component Software - 10th International Symposium, 2013

2012
Modeling and simulation of Sequential Auctions: Pricing and calibration Algorithms.
Int. J. Model. Simul. Sci. Comput., 2012

Incremental attribute based particle swarm optimization.
Proceedings of the Eighth International Conference on Natural Computation, 2012

Optimal decision-making under uncertainties.
Proceedings of the 9th International Conference on Fuzzy Systems and Knowledge Discovery, 2012

2011
Computational complexity of some intelligent computing systems.
Int. J. Intell. Comput. Cybern., 2011

An Option Pricing Model Calibration Using Algorithmic Differentiation.
Proceedings of the Computer and Information Sciences II, 2011

2010
A probabilistic framework for Automated Mechanism Design.
Proceedings of 2010 IEEE International Conference on Service Operations and Logistics, 2010

2008
Fast Automatic Differentiation Jacobians by Compact LU Factorization.
SIAM J. Sci. Comput., 2008

Vertex-ordering Algorithms for Automatic Differentiation of Computer Codes.
Comput. J., 2008

Abstracting and Verifying Strategy-Proofness for Auction Mechanisms.
Proceedings of the Declarative Agent Languages and Technologies VI, 2008

Abstractions for model-checking game-theoretic properties of auctions.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

2007
Verifying Dominant Strategy Equilibria in Auctions.
Proceedings of the Multi-Agent Systems and Applications V, 2007

Complexity of Verifying Game Equilibria.
Proceedings of the Multi-Agent Systems and Applications V, 2007

2006
Realising Common Knowledge Assumptions in Agent Auctions.
Proceedings of the 2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2006

2004
Jacobian code generated by source transformation and vertex elimination can be as efficient as hand-coding.
ACM Trans. Math. Softw., 2004

2003
Hierarchical Automatic Differentiation by Vertex Elimination and Source Transformation.
Proceedings of the Computational Science and Its Applications, 2003

2002
Performance Issues for Vertex Elimination Methods in Computing Jacobians Using Automatic Differentiation.
Proceedings of the Computational Science - ICCS 2002, 2002

1998
Sparse Jacobian Computation in Automatic Differentiation by Static Program Analysis.
Proceedings of the Static Analysis, 5th International Symposium, 1998


  Loading...