Media Summary: Ran Haba, Ehsan Kazemi, Moran Feldman, and Amin Karbasi. Streaming Abstraction Heuristics, Cost Partitioning and Network Flows Florian Pommerening, Malte Helmert and Blai Bonet Heuristics I ... Ehsan Kazemi, Shervin Minaee, Moran Feldman, and Amin Karbasi. Regularized

Icaps 2017 Submodular Function Maximization - Detailed Analysis & Overview

Ran Haba, Ehsan Kazemi, Moran Feldman, and Amin Karbasi. Streaming Abstraction Heuristics, Cost Partitioning and Network Flows Florian Pommerening, Malte Helmert and Blai Bonet Heuristics I ... Ehsan Kazemi, Shervin Minaee, Moran Feldman, and Amin Karbasi. Regularized A Google Algorithms TechTalk, 2021/01/14, presented by Mehrdad Ghadiri. Stubborn Sets for Fully Observable Nondeterministic Planning Dominik Winterer, Yusra Alkhazraji, Michael Katz and Martin ... The study of combinatorial problems with a

This is a quick demonstration of SPA Full video: For further details check our webpage: ...

Photo Gallery

ICAPS 2017: Submodular Function Maximization for Group Elevator Scheduling
MIT 6.854 Spring 2016 Lecture 13: Submodular Functions
ICAPS 2017: Multi-objective optimization in a job shop with energy costs ...
Submodularity: Theory and Applications I
Adaptive Maximization of Pointwise Submodular Functions With Budget Constraint (NIPS 2016)
Streaming Submodular Maximization under a k-Set System Constraint (ICML 2020)
ICAPS 2017: Abstraction Heuristics, Cost Partitioning and Network Flows
Regularized Submodular Maximization at Scale
Beyond Submodular Maximization via One-Sided Smoothness and Meta-Submodularity
MIA: Yaron Singer, Maximizing submodular functions exponentially faster; Primer: Adam Breuer
ICAPS 2017: Stubborn Sets for Fully Observable Nondeterministic Planning
Continuous Methods for Submodular Maximization
View Detailed Profile
ICAPS 2017: Submodular Function Maximization for Group Elevator Scheduling

ICAPS 2017: Submodular Function Maximization for Group Elevator Scheduling

Submodular Function Maximization

MIT 6.854 Spring 2016 Lecture 13: Submodular Functions

MIT 6.854 Spring 2016 Lecture 13: Submodular Functions

Recorded by Andrew Xia 2016.

ICAPS 2017: Multi-objective optimization in a job shop with energy costs ...

ICAPS 2017: Multi-objective optimization in a job shop with energy costs ...

Multi-objective

Submodularity: Theory and Applications I

Submodularity: Theory and Applications I

Stefanie Jegelka, MIT https://simons.berkeley.edu/talks/andreas-krause-stefanie-jegelka-01-23-

Adaptive Maximization of Pointwise Submodular Functions With Budget Constraint (NIPS 2016)

Adaptive Maximization of Pointwise Submodular Functions With Budget Constraint (NIPS 2016)

Spotlight video for paper "Adaptive

Streaming Submodular Maximization under a k-Set System Constraint (ICML 2020)

Streaming Submodular Maximization under a k-Set System Constraint (ICML 2020)

Ran Haba, Ehsan Kazemi, Moran Feldman, and Amin Karbasi. Streaming

ICAPS 2017: Abstraction Heuristics, Cost Partitioning and Network Flows

ICAPS 2017: Abstraction Heuristics, Cost Partitioning and Network Flows

Abstraction Heuristics, Cost Partitioning and Network Flows Florian Pommerening, Malte Helmert and Blai Bonet Heuristics I ...

Regularized Submodular Maximization at Scale

Regularized Submodular Maximization at Scale

Ehsan Kazemi, Shervin Minaee, Moran Feldman, and Amin Karbasi. Regularized

Beyond Submodular Maximization via One-Sided Smoothness and Meta-Submodularity

Beyond Submodular Maximization via One-Sided Smoothness and Meta-Submodularity

A Google Algorithms TechTalk, 2021/01/14, presented by Mehrdad Ghadiri.

MIA: Yaron Singer, Maximizing submodular functions exponentially faster; Primer: Adam Breuer

MIA: Yaron Singer, Maximizing submodular functions exponentially faster; Primer: Adam Breuer

The algorithms are designed for

ICAPS 2017: Stubborn Sets for Fully Observable Nondeterministic Planning

ICAPS 2017: Stubborn Sets for Fully Observable Nondeterministic Planning

Stubborn Sets for Fully Observable Nondeterministic Planning Dominik Winterer, Yusra Alkhazraji, Michael Katz and Martin ...

Continuous Methods for Submodular Maximization

Continuous Methods for Submodular Maximization

The study of combinatorial problems with a

ICAPS 2020 Demonstration

ICAPS 2020 Demonstration

This is a quick demonstration of SPA Full video: https://youtu.be/Gd4CMKclkBY For further details check our webpage: ...