![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Jean-Christophe Weill
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j4]Miwako Tsuji
, William T. C. Kramer, Jean-Christophe Weill, Jean-Philippe Nominé, Mitsuhisa Sato:
A new sustained system performance metric for scientific performance evaluation. J. Supercomput. 77(7): 6476-6504 (2021) - [c7]Lilia Zaourar, Mohamed Benazouz, Ayoub Mouhagir
, Fatma Jebali, Tanguy Sassolas, Jean-Christophe Weill, Carlos Falquez, Nam Ho, Dirk Pleiter, Antoni Portero
, Estela Suarez, Polydoros Petrakis
, Vassilis Papaefstathiou, Manolis Marazakis, Milan Radulovic, Francesc Martínez, Adrià Armejach, Marc Casas, Alejandro Nocua, Romain Dolbeau
:
Multilevel simulation-based co-design of next generation HPC microprocessors. PMBS 2021: 18-29 - 2020
- [c6]Théo Saillant, Jean-Christophe Weill, Mathilde Mougeot:
Predicting Job Power Consumption Based on RJMS Submission Data in HPC Systems. ISC 2020: 63-82
2010 – 2019
- 2017
- [i1]Amaury Johnen, Jean-Christophe Weill, Jean-François Remacle:
Robust and efficient validation of the linear hexahedral element. CoRR abs/1706.01613 (2017) - 2014
- [c5]Nicolas Le Goff, Franck Ledoux, Jean-Christophe Weill:
Hexahedral Mesh Adaptation to Imprint Geometric Details: Application to CAD Models. Eurographics (Posters) 2014: 13-14 - 2013
- [e1]Xiangmin Jiao
, Jean-Christophe Weill:
Proceedings of the 21st International Meshing Roundtable, IMR 2012, October 7-10, 2012, San Jose, CA, USA. Springer 2013, ISBN 978-3-642-33572-3 [contents] - 2012
- [c4]Franck Ledoux, Nicolas Le Goff, Steven J. Owen, Matthew L. Staten, Jean-Christophe Weill:
A Constraint-Based System to Ensure the Preservation of Sharp Geometric Features in Hexahedral Meshes. IMR 2012: 315-332
2000 – 2009
- 2007
- [c3]Franck Ledoux, Jean-Christophe Weill:
An Extension of the Reliable Whisker Weaving Algorithm. IMR 2007: 215-232 - 2000
- [c2]Christophe Lemaire, Jean-Christophe Weill:
Partitioning the sphere with constant area quadrangles. CCCG 2000
1990 – 1999
- 1996
- [j3]Jean-Christophe Weill:
The ABDADA Distributed Minimax-Search Algorithm. J. Int. Comput. Games Assoc. 19(1): 3-16 (1996) - [c1]Jean-Christophe Weill:
The ABDADA Distributed Minimax Search Algorithm. ACM Conference on Computer Science 1996: 131-138 - 1995
- [j2]Jean-Christophe Weill:
Computer-Chess Championship Programs: Software Design, Synthesis of Evaluation Functions, Parallel Searches. J. Int. Comput. Games Assoc. 18(3): 168 (1995) - 1992
- [j1]Jean-Christophe Weill:
The NegaC* Search. J. Int. Comput. Games Assoc. 15(1): 3-7 (1992)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-05-08 21:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint