会议信息

SoCS 2026: International Symposium on Combinatorial Search

请登录查看会议网址
免费注册：查看官网链接、跟踪截稿日期，并接收邮件提醒。
注册 登录
截稿日期:
2026-03-16 已截稿
通知日期:
2026-05-16
会议日期:
2026-08-14
会议地点:
Bremerhaven, Germany
届数:
19
ICORE: B   浏览: 1114   关注: 0   参加: 0
这一页信息有误？告诉我们
嵌入截止倒计时徽章
SoCS
用 API 获取这条数据
搜索与榜单列表完全无需凭证；本页的完整详情需要一把免费 API 密钥。详见开发者接入页。

会伴指数 (CP-I)

57.1 / 100
全站第 735 名 / 共 5,769 个会议 · 前 13%

理论与算法 第 46 / 142

学术认可 (35%)
72
投稿选择性 (20%) 无数据 —— 按中性基准 50 分计入 —
会议传承 (20%)
81
社区关注 (10%)
5
资料公开度 (15%)
35

用到的输入: 收录等级：ICORE B · 有据可查的届次：19 · 过去 24 个月打开过本页的研究者：1 人

公开资料里还缺: 历年录用率 (+4.5) · 历届信息 (+3.0) · 最佳论文记录 (+2.3)
主办方认领本会议后，可直接在这一页补上；分数每晚重算。如何提升这个分数

置信度 80% —— 分数中有多大比例来自实际观测到的数据，而不是中性基准。 这个分数是怎么算出来的 · 查看完整榜单 · 算法版本 1.2 · 算于 2026-11-05

征稿

SoCS 2026 (International Symposium on Combinatorial Search) is a ICORE B conference held in Bremerhaven, Germany on 2026-08-14. The paper submission deadline is 2026-03-16. Acceptance notifications are sent on 2026-05-16.

Heuristic search and other forms of combinatorial search and optimization are highly active areas of research across artificial intelligence, robotics, planning, discrete optimization, and related fields in computer science and operations research. The International Symposium on Combinatorial Search (SoCS) aims to bring together researchers working in these areas to exchange ideas and foster cross-fertilization across disciplines. SoCS welcomes submissions from all research communities that employ combinatorial search techniques, including artificial intelligence, planning, robotics, constraint programming, meta-reasoning, operations research, navigation, and bioinformatics. We particularly encourage submissions that present real-world applications of heuristic search. Given its co-location with IJCAI 2026, SoCS especially welcomes papers that explore the interface between combinatorial search and other areas of AI research. Topics of interest: Topics of interest include but are not limited to the following: Adversarial search Analysis of search algorithms Automated synthesis of lower bounds Bidirectional search Bounding and pruning techniques Combinatorial optimization Combinatorial puzzles Continuous problem solving Constraint search Deep learning in heuristics and search External-memory and parallel search Heuristics Incremental and active learning in search Machine learning for or in search algorithms Metareasoning and search Methodology and critiques of current practice Model-based search Multi-agent pathfinding Pathfinding Portfolios of search algorithms Problem compilation Problem-solving using search Random vs. systematic search strategy selection Real-life applications Real-time search Reinforcement learning and search Search in goal-directed problem solving Search space discretization for continuous state-space problems Search-based diagnosis Search in Boolean satisfiability Search in machine learning and big data analytics Search methods in robotics Search for Large Language models (LLMs) Self-configuring and self-tuning algorithms Symmetry handling Time, memory, and solution quality trade-offs Tools, Software frameworks, and benchmarks
由 Admin Agent 最后更新于

相关会议

相关期刊

CCF全称影响因子出版商ISSN
Journal of Combinatorial Optimization1.1Springer1382-6905
Journal of Combinatorial Theory, Series A1.2Elsevier0097-3165
Journal of Combinatorial Theory, Series B1.2Elsevier0095-8956
AIEEE Transactions on Multimedia9.7IEEE1520-9210
CKnowledge-Based Systems7.2Elsevier0950-7051
BSoftware & Systems Modeling3.2Springer1619-1366
AIEEE Transactions on Computers3.8IEEE0018-9340
CFuture Generation Computer Systems5.9Elsevier0167-739X
CNeurocomputing6.5Elsevier0925-2312
CPattern Recognition Letters3.5Elsevier0167-8655

评论 0

暂无评论。

请登录后发表评论