Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 278 matches
- 2024
- Séverine Erhel, Joeffrey Drouard, Florence Jacob, Marianne Lumeau, Raphaël Suire, Corentin Gonthier:
Predictors of problematic internet use in the everyday internet activities of a French representative sample: The importance of psychological traits. Comput. Hum. Behav. 153: 108099 (2024) - Esra'a Alhenawi, Ruba Abu Khurma, Robertas Damasevicius, Abdelazim G. Hussien:
Solving Traveling Salesman Problem Using Parallel River Formation Dynamics Optimization Algorithm on Multi-core Architecture Using Apache Spark. Int. J. Comput. Intell. Syst. 17(1): 4 (2024) - Paul H. Edelman, Martin Van der Linden, John A. Weymark:
The core of a transferable utility game as the solution to a public good market demand problem. Math. Program. 203(1): 687-702 (2024) - Stanley Alama, Lia Bronsard, Xin Yang Lu, Chong Wang:
Core Shells and Double Bubbles in a Weighted Nonlocal Isoperimetric Problem. SIAM J. Math. Anal. 56(2): 2357-2394 (2024) - Xin-Duo Liu, Weijia He, Ming-Lin Yang, Xin-Qing Sheng:
Massive parallelization of multilevel fast multipole algorithm for 3-D electromagnetic scattering problems on SW26010 many-core cluster. J. Supercomput. 80(7): 8702-8718 (2024) - Corentin Bodart:
Membership problems in nilpotent groups. CoRR abs/2401.15504 (2024) - 2023
- Arianna Alfieri, Michele Garraffa, Erica Pastore, Fabio Salassa:
Permutation flowshop problems minimizing core waiting time and core idle time. Comput. Ind. Eng. 176: 108983 (2023) - Alberto Domínguez Corella, Nicolai Jork, Vladimir M. Veliov:
On the solution stability of parabolic optimal control problems. Comput. Optim. Appl. 86(3): 1035-1079 (2023) - Martina Cerulli, Domenico Serra, Carmine Sorgente, Claudia Archetti, Ivana Ljubic:
Mathematical programming formulations for the Collapsed k-Core Problem. Eur. J. Oper. Res. 311(1): 56-72 (2023) - Eduardo Casas, Alberto Domínguez Corella, Nicolai Jork:
New Assumptions for Stability Analysis in Elliptic Optimal Control Problems. SIAM J. Control. Optim. 61(3): 1394-1414 (2023) - Iveta Hnetynková, Martin Plesinger, Jana Záková:
Krylov Subspace Approach to Core Problems within Multilinear Approximation Problems: A Unifying Framework. SIAM J. Matrix Anal. Appl. 44(1): 53-79 (2023) - Feiteng Zhang, Bin Liu, Zhenming Liu, Qizhi Fang:
Order based algorithms for the core maintenance problem on edge-weighted graphs. Theor. Comput. Sci. 941: 140-155 (2023) - Shafiuddin Rehan Ahmed, Abhijnan Nath, James H. Martin, Nikhil Krishnaswamy:
2*n is better than n²: Decomposing Event Coreference Resolution into Two Tractable Problems. ACL (Findings) 2023: 1569-1583 - Weronika Borek-Marciniec, Pawel Ksieniewicz:
Hollow n-grams Vectorizer for Natural Language Processing Problems. CORES/IP&C 2023: 15-22 - Joanna Komorniczak, Pawel Ksieniewicz, Michal Wozniak:
Analysis of the Possibility to Employ Relationship Between the Problem Complexity and the Classification Quality as Model Optimization Proxy. CORES/IP&C 2023: 71-82 - Isabelle Kuhlmann, Carl Corea, John Grant:
An ASP-Based Framework for Solving Problems Related to Declarative Process Specifications. NMR 2023: 129-132 - Yuqian Lv, Bo Zhou, Jinhuan Wang, Qi Xuan:
Targeted k-node Collapse Problem: Towards Understanding the Robustness of Local k-core Structure. CoRR abs/2301.00108 (2023) - Jianwen Zhou, Hai-Jun Zhou:
Hierarchical cycle-tree packing model for K-core attack problem. CoRR abs/2303.01007 (2023) - Botond B. Antal, Anthony G. Chesebro, Helmut H. Strey, Lilianne R. Mujica-Parodi, Corey Weistuch:
FixFit: using parameter-compression to solve the inverse problem in overdetermined models. CoRR abs/2303.13746 (2023) - Shafiuddin Rehan Ahmed, Abhijnan Nath, James H. Martin, Nikhil Krishnaswamy:
2*n is better than n2: Decomposing Event Coreference Resolution into Two Tractable Problems. CoRR abs/2305.05672 (2023) - Yixin Liu, Avi Singh, C. Daniel Freeman, John D. Co-Reyes, Peter J. Liu:
Improving Large Language Model Fine-tuning for Solving Math Problems. CoRR abs/2310.10047 (2023) - Avi Singh, John D. Co-Reyes, Rishabh Agarwal, Ankesh Anand, Piyush Patil, Xavier Garcia, Peter J. Liu, James Harrison, Jaehoon Lee, Kelvin Xu, Aaron Parisi, Abhishek Kumar, Alex Alemi, Alex Rizkowsky, Azade Nova, Ben Adlam, Bernd Bohnet, Gamaleldin F. Elsayed, Hanie Sedghi, Igor Mordatch, Isabelle Simpson, Izzeddin Gur, Jasper Snoek, Jeffrey Pennington, Jiri Hron, Kathleen Kenealy, Kevin Swersky, Kshiteej Mahajan, Laura Culp, Lechao Xiao, Maxwell L. Bileschi, Noah Constant, Roman Novak, Rosanne Liu, Tris Warkentin, Yundi Qian, Yamini Bansal, Ethan Dyer, Behnam Neyshabur, Jascha Sohl-Dickstein, Noah Fiedel:
Beyond Human Data: Scaling Self-Training for Problem-Solving with Language Models. CoRR abs/2312.06585 (2023) - 2022
- Sihan Liu, Boya Xu, Di Zhang, Yuxin Tian, Xinchun Wu:
Core symptoms and symptom relationships of problematic internet use across early, middle, and late adolescence: A network analysis. Comput. Hum. Behav. 128: 107090 (2022) - Sébastien Martin, Youcef Magnouche, Corentin Juvigny, Jérémie Leguay:
Constrained shortest path tour problem: Branch-and-Price algorithm. Comput. Oper. Res. 144: 105819 (2022) - Amir Zeldes:
Opinion Piece: Can we Fix the Scope for Coreference?: Problems and Solutions for Benchmarks beyond OntoNotes. Dialogue Discourse 13(1): 41-62 (2022) - Corentin Kilque:
Weakly Nonlinear Multiphase Geometric Optics for Hyperbolic Quasilinear Boundary Value Problems: Construction of a Leading Profile. SIAM J. Math. Anal. 54(2): 2413-2507 (2022) - Didier El Baz, Bilal Fakih, Romeo Sanchez Nigenda, Vincent Boyer:
Parallel best-first search algorithms for planning problems on multi-core processors. J. Supercomput. 78(3): 3122-3151 (2022) - Zhongxin Zhou, Wenchao Zhang, Fan Zhang, Deming Chu, Binghao Li:
VEK: a vertex-oriented approach for edge k-core problem. World Wide Web 25(2): 723-740 (2022) - Olexandr Polishchuk:
Structural Cores and Problems of Vulnerability of Partially Overlapped Multilayer Networks. COMPLEX NETWORKS (1) 2022: 613-624 - Ruomin Huang, Jiawei Huang, Wenjie Liu, Hu Ding:
Coresets for Wasserstein Distributionally Robust Optimization Problems. NeurIPS 2022
skipping 248 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-08 15:05 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint