Parallel Constraint Solving is a computational method within constraint programming that exploits parallel execution strategies to simultaneously explore multiple subproblems or inference paths in order to accelerate the search for solutions to combinatorial problems.
51
Publications
21.9K
Citations
107
Authors
76
Institutions
Publications per year
2017–2026
5
Parents
Publications
51
Unified particle physics for real-time applications
Miles Macklin, Matthias Müller, Nuttapong Chentanez et al. · ACM Transactions on Graphics · 2014 · 435 citations
Fast parallel constraint satisfaction
Lefteris M. Kirousis · Artificial Intelligence · 1993 · 76 citations
1–5 of 51
Authors
107
- PC
5
h-index
- FR
3
h-index
- YC
3
h-index
- PV
2
h-index
- DD
2
h-index
1–5 of 107
Institutions
76
Sorbonne Université
Paris, France
3 h-index
3 publications
37 citations
The University of Tokyo
Tokyo, Japan
3 h-index
4 publications
51 citations
Centre National de la Recherche Scientifique
Paris, France
3 h-index
6 publications
156 citations
The University of Texas at Austin
Austin, United States
2 h-index
3 publications
61 citations
University of Lisbon
Lisbon, Portugal
2 h-index
4 publications
232 citations
Laboratoire de l'Informatique du Parallélisme
Lyon, France
2 h-index
2 publications
34 citations
Université Paris Cité
Paris, France
2 h-index
2 publications
38 citations
International Research Center for Japanese Studies
Kyoto, Japan
2 h-index
3 publications
61 citations
1–8 of 76
Venues
- Constraints
3 publications · 149 citations
3
h-index
- Journal of Chemical Theory and Computation
JCTC · 2 publications · 20.1K citations
2
h-index
- National Conference on Artificial Intelligence
Conference · 2 publications · 49 citations
2
h-index
- INFORMS journal on computing
2 publications · 80 citations
2
h-index
- ACM Transactions on Programming Languages and Systems
1 publications · 23 citations
1
h-index
1–5