4488 search results - page 156 / 898 » Properties of NP-Complete Sets |
178
click to vote
AI
2011
Springer
14 years 9 months ago
2011
Springer
Although propositional satisfiability (SAT) is NP-complete, state-of-the-art SAT solvers are able to solve large, practical instances. The concept of backdoors has been introduced...
176
click to vote
DLOG
2011
14 years 9 months ago
2011
We study a restriction of the classification procedure for EL++ where the inference rule for complex role inclusion axioms (RIAs) is applied in a “left-linear” way in analogy ...
213
click to vote
FORTE
2011
14 years 9 months ago
2011
We present a new, streamlined language of global types equipped with a trace-based semantics and whose features and restrictions are semantically justified. The multi-party sessio...
203
click to vote
ALT
2011
Springer
14 years 5 months ago
2011
Springer
This paper studies the deviations of the regret in a stochastic multi-armed bandit problem. When the total number of plays n is known beforehand by the agent, Audibert et al. (2009...
194
click to vote
ATVA
2011
Springer
14 years 5 months ago
2011
Springer
We present the Self-Loop Aggregation Product (SLAP), a new hybrid technique that replaces the synchronized product used in the automata-theoretic approach for LTL model checking. T...