56 search results - page 1 / 12 » Dynamically Partitioning for Solving QBF |
SAT
2007
Springer
14 years 1 months ago
2007
Springer
AAAI
2007
13 years 9 months ago
2007
We present a novel approach to solving Quantified Boolean Formulas (QBF) that combines a search-based QBF solver with machine learning techniques. We show how classification met...
EGH
2005
Springer
14 years 29 days ago
2005
Springer
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
ICDCS
1998
IEEE
13 years 11 months ago
1998
IEEE
Network applications and services need to be environment-aware in order to meet non-functional requirements in increasingly dynamic contexts. In this paper we consider partition a...
AAAI
2007
13 years 9 months ago
2007
For autonomous artificial decision-makers to solve realistic tasks, they need to deal with searching through large state and action spaces under time pressure. We study the probl...