Sciweavers

4488 search results - page 156 / 898
» Properties of NP-Complete Sets
Sort
View
AI
2011
Springer
12 years 12 months ago
Finding Small Backdoors in SAT Instances
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...
Zijie Li, Peter van Beek
DLOG
2011
12 years 11 months ago
Unchain My EL Reasoner
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 ...
Yevgeny Kazakov, Markus Krötzsch, Frantisek S...
FORTE
2011
12 years 11 months ago
On Global Types and Multi-party Sessions
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...
Giuseppe Castagna, Mariangiola Dezani-Ciancaglini,...
ALT
2011
Springer
12 years 8 months ago
Deviations of Stochastic Bandit Regret
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...
Antoine Salomon, Jean-Yves Audibert
ATVA
2011
Springer
240views Hardware» more  ATVA 2011»
12 years 8 months ago
Self-Loop Aggregation Product - A New Hybrid Approach to On-the-Fly LTL Model Checking
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...
Alexandre Duret-Lutz, Kais Klai, Denis Poitrenaud,...