default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmmanuel M. Tadjouddine
Person information
- affiliation: University of Aberdeen, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j8]Huan Gao, Hai-Bin Zhang, Zhibao Li, Emmanuel M. Tadjouddine:
A nonmonotone inexact Newton method for unconstrained optimization. Optim. Lett. 11(5): 947-965 (2017)- 2016
- [j7]Emmanuel M. Tadjouddine:
Calibration based on entropy minimization for a class of asset pricing models. Appl. Soft Comput. 42: 431-438 (2016) - 2015
- [c15]Wei Bai, Emmanuel M. Tadjouddine, Terry R. Payne
:
A Dialectical Approach to Enable Decision Making in Online Trading. EUMAS/AT 2015: 203-218 - 2014
- [j6]Emmanuel M. Tadjouddine, Wenjin Lv:
Foundational Certification of Code Transformations Using Automatic Differentiation. Comput. Sci. 15(2): 215-236 (2014) - [c14]Wei Bai, Emmanuel M. Tadjouddine, Yu Guo:
Enabling Automatic Certification of Online Auctions. FESCA 2014: 123-132 - 2013
- [c13]Wei Bai, Emmanuel M. Tadjouddine, Terry R. Payne, Sheng-Uei Guan:
A Proof-Carrying Code Approach to Certificate Auction Mechanisms. FACS 2013: 23-40 - 2012
- [j5]Emmanuel M. Tadjouddine:
Modeling and simulation of Sequential Auctions: Pricing and calibration Algorithms. Int. J. Model. Simul. Sci. Comput. 3(3): 1250009 (2012) - [c12]Emmanuel M. Tadjouddine, Xiaoyi Wu:
Optimal decision-making under uncertainties. FSKD 2012: 491-496 - [c11]Wei Bai, Shi Cheng, Emmanuel M. Tadjouddine, Sheng-Uei Guan:
Incremental attribute based particle swarm optimization. ICNC 2012: 669-674 - 2011
- [j4]Emmanuel M. Tadjouddine:
Computational complexity of some intelligent computing systems. Int. J. Intell. Comput. Cybern. 4(2): 144-159 (2011) - [c10]Emmanuel M. Tadjouddine, Yi Cao:
An Option Pricing Model Calibration Using Algorithmic Differentiation. ISCIS 2011: 577-581 - 2010
- [c9]Emmanuel M. Tadjouddine:
A probabilistic framework for Automated Mechanism Design. SOLI 2010: 315-320
2000 – 2009
- 2008
- [j3]Emmanuel M. Tadjouddine:
Vertex-ordering Algorithms for Automatic Differentiation of Computer Codes. Comput. J. 51(6): 688-699 (2008) - [j2]John D. Pryce, Emmanuel M. Tadjouddine:
Fast Automatic Differentiation Jacobians by Compact LU Factorization. SIAM J. Sci. Comput. 30(4): 1659-1677 (2008) - [c8]Emmanuel M. Tadjouddine, Frank Guerin, Wamberto Weber Vasconcelos:
Abstractions for model-checking game-theoretic properties of auctions. AAMAS (3) 2008: 1613-1616 - [c7]Emmanuel M. Tadjouddine, Frank Guerin, Wamberto Weber Vasconcelos:
Abstracting and Verifying Strategy-Proofness for Auction Mechanisms. DALT 2008: 197-214 - 2007
- [c6]Emmanuel M. Tadjouddine:
Complexity of Verifying Game Equilibria. CEEMAS 2007: 103-112 - [c5]Emmanuel M. Tadjouddine, Frank Guerin:
Verifying Dominant Strategy Equilibria in Auctions. CEEMAS 2007: 288-297 - 2006
- [c4]Frank Guerin, Emmanuel M. Tadjouddine:
Realising Common Knowledge Assumptions in Agent Auctions. IAT 2006: 579-586 - 2004
- [j1]Shaun A. Forth, Mohamed Tadjouddine, John D. Pryce, John K. Reid:
Jacobian code generated by source transformation and vertex elimination can be as efficient as hand-coding. ACM Trans. Math. Softw. 30(3): 266-299 (2004) - 2003
- [c3]Mohamed Tadjouddine, Shaun A. Forth, John D. Pryce:
Hierarchical Automatic Differentiation by Vertex Elimination and Source Transformation. ICCSA (2) 2003: 115-124 - 2002
- [c2]Mohamed Tadjouddine, Shaun A. Forth, John D. Pryce, John K. Reid:
Performance Issues for Vertex Elimination Methods in Computing Jacobians Using Automatic Differentiation. International Conference on Computational Science (2) 2002: 1077-1086
1990 – 1999
- 1998
- [c1]Mohamed Tadjouddine, F. Eyssette, C. Faure:
Sparse Jacobian Computation in Automatic Differentiation by Static Program Analysis. SAS 1998: 311-326
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
