ICALP 2020

Q/A Slot F1 — ICALP-A

Sep 23, 2020

|

34 views

Saarland Informatics Campus

Details

SAT, 11.07.2020, 14:00-15:00 UTC+2 Papers: • Scheduling in the Random-Order Model • Lower bounds for dynamic distributed task allocation • Faster Minimization of Tardy Processing Time on a Single Machine • Breaking the Barrier of 2 for the Storage Allocation Problem • The Online Min-Sum Set Cover Problem • Online Algorithms for Weighted Paging with Predictions

Category: ICALP 2020

Comments

loading...

Reactions (0) | Note

📝 No reactions yet

Be the first one to share your thoughts!

Reactions(0)

Note

loading...

Recommended

ICAPS 2014: Enrico Scala on "Plan Repair for Resource Constrained Tasks via Numeric Macro Actions"

ICAPS | Jul 23, 2014

ICAPS 2014: Truong-Huy Dinh Nguyen on "Bootstrapping Simulation-Based Algorithms..."

ICAPS | Aug 5, 2014

ICAPS 2014: Peter Stone on "TEXPLORE: Real-Time Sample-Efficient Reinforcement Learning for Robots"

ICAPS | Aug 6, 2014

ICAPS 2014: Ron Alford on "On the Feasibility of Planning Graph Style Heuristics for HTN Planning"

ICAPS | Aug 6, 2014

ICAPS 2014: Mike Barley on "Overcoming the Utility Problem in Heuristic Generation: ..."

ICAPS | Aug 7, 2014