Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2017

Highly Cited

2017

This paper introduces SC2LE (StarCraft II Learning Environment), a reinforcement learning environment based on the StarCraft II… Expand

Highly Cited

2012

Highly Cited

2012

We propose a consumption scheduling mechanism for home area load management in smart grid using integer linear programming (ILP… Expand

2007

2007

We consider a generalization of the Stable Roommates problem (sr), in which preference lists may be partially ordered and… Expand

Highly Cited

2006

Highly Cited

2006

This paper focuses on the interactive effects of power and emotion in negotiation. Previous research has shown that negotiators… Expand

Highly Cited

2005

Highly Cited

2005

We present a novel method for exactly solving (in fact, counting solutions to) general constraint satisfaction optimization with… Expand

Highly Cited

1998

Highly Cited

1998

This paper starts with the project of finding a large subclass of NP which exhibits a dichotomy. The approach is to find this… Expand

Highly Cited

1995

Highly Cited

1995

We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems… Expand

Highly Cited

1994

Highly Cited

1994

We present randomized approximation algorithms for the MAX CUT and MAX 2SAT problems that always deliver solutions of expected… Expand

Highly Cited

1992

Highly Cited

1992

Consider a randomly generated boolean formula F (in the conjunctive normal form) with m clauses of size k over n variables; k is… Expand

Highly Cited

1984

Highly Cited

1984

3-SAT is NP-complete when restricted to instances where each variable appears in at most four clauses. When no variable appears… Expand