Spain

ECAI 2020

Is hardness inherent in computational problems? Performance of human and electronic computers on random instances of the 0-1 knapsack problem.

knapsack problem

human problem solving

phase transition

The purpose of the AAAI conference is to promote research in artificial intelligence (AI) and scientific exchange among AI researchers, practitioners, scientists, and engineers in affiliated disciplines. 

AAAI 2021

technical paper

ECAI2020 featured a full programme of technical papers, as well as many AI-related events of interest for researchers, students and all attendants who are interested on contemporary AI, including:




**An extensive programme of workshops, tutorials, and invited speakers**

**The Prestigious Applications of Intelligent Systems conference (PAIS)**

**The Frontiers in AI track sessions**

**The Lab To Market event**

**The Women in AI time**

**The EU Challenges forum**

… and many more!

ECAI 2020 featured a full programme of technical papers, as well as many AI-related events of interest for researchers, students and all attendants who are interested on contemporary AI.

A Multilayered Informative Random Walk for Attributed Social Network Embedding

Semantics of negative sequential patterns

Maximum Entropy Reinforced Single Object Visual Tracking

Preprocessing in Incomplete MaxSAT Solving

Resilient Distributed Constraints Optimization in Physical Multi-Agent Systems

Committee Selection with Multimodal Preferences

Consolidating Modal Knowledge Bases

Finding Quantum Critical Points with Neural-Network Quantum States

Integrating Network Embedding and Community Outlier Detection via Multiclass Graph Description

Necessary and Sufficient Conditions for Actual Root Causes

https://d3smihljt9218e.cloudfront.net/transcript/1193/subtitle/df85b29c811b609db92b086cc651613c.vtt

English (automatic)

Downloads

Next from ECAI 2020

A Multilayered Informative Random Walk for Attributed Social Network Embedding

Similar lecture

Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size

.css-70qvj9{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;}Downloads

Next from ECAI 2020

A Multilayered Informative Random Walk for Attributed Social Network Embedding

Similar lecture

Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size

Downloads