![](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
Majid Karimi
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
- 2024
- [j7]Majid Karimi
, Stanko Dimitrov
:
To Subsidize Or Not to Subsidize: A Comparison of Market Scoring Rules and Continuous Double Auctions for Price Discovery. Inf. Syst. Frontiers 26(2): 801-823 (2024) - 2023
- [c3]Arthur Carvalho, Majid Karimi:
Selecting the Optimal Number of Crowd Workers for Forecasting Tasks. AMCIS 2023 - 2022
- [j6]Majid Karimi
, Nima Zaerpour
:
Put your money where your forecast is: Supply chain collaborative forecasting with cost-function-based prediction markets. Eur. J. Oper. Res. 300(3): 1035-1049 (2022) - [j5]Robert Aboolian, Oded Berman, Majid Karimi
:
Probabilistic Set Covering Location Problem in Congested Networks. Transp. Sci. 56(2): 528-542 (2022) - 2021
- [j4]Arthur Carvalho, Majid Karimi
:
Aligning the interests of newsvendors and forecasters through blockchain-based smart contracts and proper scoring rules. Decis. Support Syst. 151: 113626 (2021) - 2020
- [c2]Arthur Carvalho, Majid Karimi:
How Blockchain Can Bring Trust and Transparency to the Payment of Crowd Forecasters. ICIS 2020
2010 – 2019
- 2018
- [j3]Majid Karimi
, Stanko Dimitrov
:
On the Road to Making Science of "Art": Risk Bias in Market Scoring Rules. Decis. Anal. 15(2): 72-89 (2018) - 2012
- [i1]Babak Farzad, Majid Karimi:
Square-Root Finding Problem In Graphs, A Complete Dichotomy Theorem. CoRR abs/1210.7684 (2012)
2000 – 2009
- 2005
- [j2]Raymond Pavloski
, Majid Karimi:
The self-trapping attractor neural network-part II: properties of a sparsely connected model storing multiple memories. IEEE Trans. Neural Networks 16(6): 1427-1439 (2005) - 2003
- [j1]Raymond Pavloski
, Majid Karimi:
The self-trapping attractor neural network. I. Analysis of a simple 1-D model. IEEE Trans. Neural Networks 14(1): 58-65 (2003)
1990 – 1999
- 1999
- [c1]Raymond Pavloski, Majid Karimi:
Self-trapping in an attractor neural network with nearest neighbor synapses mimics full connectivity. IJCNN 1999: 699-704
![](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-06 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint