Results 81 to 90 of about 3,355,376 (309)

09421 Abstracts Collection – Algebraic Methods in Computational Complexity [PDF]

, 2010
From 11.10. to 16.10.2009, the Dagstuhl Seminar 09421 ``Algebraic Methods in Computational Complexity '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.
Agrawal, Manindra, Umans, Christopher, Thierauf, Thomas, Fortnow, Lance   +3 more
core   +1 more source

Case-based complexity: within-case time variation and temporal casing

, 2021
We observe that time is central to most social dynamics and yet remains poorly understood. The complexity sciences have contributed a wide range of concepts and tools to investigate and recast time in social systems.
Chang, Robin, Chang, Robin A., Gerrits, Lasse, Pagliarin, Sofia   +3 more
core   +1 more source

The computational complexity of rationalizing Pareto optimal choice behavior [PDF]

We consider a setting where a coalition of individuals chooses one or several alternatives from each set in a collection of choice sets. We examine the computational complexity of Pareto rationalizability.
Thomas DEMUYNCK
core   +2 more sources

Stimulator of interferon genes agonist augmented antitumor immunity of osimertinib in Egfr‐mutated lung cancer

Molecular Oncology, EarlyView.
Combining osimertinib with the STING agonist ADU‐S100 activates innate and adaptive immunity to overcome the non‐inflamed microenvironment of Egfr‐mutant lung cancer. This combination increases NK and CD8+ T‐cell infiltration, associated with activation of the STING‐IRF3 pathway and local immunogenic cell death.
Jun Nishimura, Tadahiro Kuribayashi, Johannes Brägelmann, Sachi Okawa, Masataka Taoka, Shunta Mori, Tomoka Nishimura, Takaaki Tanaka, Go Makimoto, Kiichiro Ninomiya, Kammei Rai, Eiki Ichihara, Ryohei Katayama, Katsuyuki Hotta, Masahiro Tabata, Yosuke Togashi, Yoshinobu Maeda, Martin L. Sos, Katsuyuki Kiura, Kadoaki Ohashi   +19 more
wiley   +1 more source

07411 Abstracts Collection – Algebraic Methods in Computational Complexity [PDF]

, 2008
From 07.10. to 12.10., the Dagstuhl Seminar 07411 ``Algebraic Methods in Computational Complexity'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current
Agrawal, Manindra, Buhrman, Harry, Thierauf, Thomas, Fortnow, Lance   +3 more
core   +1 more source

Monetary Convergence Across the Economic Community of West African States: Lessons for the Envisioned West African Monetary Union

, 2022
Since its inauguration, the Economic Community of West African States has stressed its desire to advance regional integration through the establishment of a common single currency (the Eco). This policy has been considered advantageous given the economic
Alemna, David
core   +1 more source

Solution of a Nonlinear Integral Equation Arising in the Moment Approximation of Spatial Logistic Dynamics

Mathematics
We investigate a nonlinear integral equation derived through moment approximation from the individual-based representation of spatial logistic dynamics. The equation describes how the densities of pairs of individuals represented by points in continuous ...
Mikhail Nikolaev, Alexey Nikitin, Ulf Dieckmann   +2 more
doaj   +1 more source

Eliminating the Effect of Rating Bias on Reputation Systems

Complexity, 2018
The ongoing rapid development of the e-commercial and interest-base websites makes it more pressing to evaluate objects’ accurate quality before recommendation.
Leilei Wu, Zhuoming Ren, Xiao-Long Ren, Jianlin Zhang, Linyuan Lü   +4 more
doaj   +1 more source

Fourier spectra of measures associated with algorithmically random Brownian motion [PDF]

Logical Methods in Computer Science, 2014
In this paper we study the behaviour at infinity of the Fourier transform of Radon measures supported by the images of fractal sets under an algorithmically random Brownian motion.
Willem Louw Fouché, Safari Mukeru, George Davie   +2 more
doaj   +1 more source

Computational Complexity and the Existence of Complexity Gaps [PDF]

Journal of the ACM, 1972
Some consequences of the Blum axioms for step counting functions are investigated. Complexity classes of recursive functions are introduced analogous to the HartmanisStearns classes of recursive sequences. Arbitrarily large "gaps" are shown to occur throughout any complexity hierarchy.
openaire   +1 more source