3775 search results - page 149 / 755 » The Expression Problem Revisited |
133
Voted
CADE
2008
Springer
16 years 4 months ago
2008
Springer
Abstract. We consider the problem of computing the logical difference between distinct versions of description logic terminologies. For the lightweight description logic EL, we pre...
113
Voted
ALT
2009
Springer
16 years 18 days ago
2009
Springer
Abstract. We consider the framework of stochastic multi-armed bandit problems and study the possibilities and limitations of strategies that explore sequentially the arms. The stra...
128
Voted
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
— Synthesis of robot behaviors towards nontrivial goals often requires reasoning about both discrete and continuous aspects of the underlying domain. Existing approaches in build...
120
Voted
WG
1998
Springer
15 years 7 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
127
Voted
ICML
1998
IEEE
15 years 7 months ago
1998
IEEE
Many systems that learn from examples express the learned concept as a disjunction. Those disjuncts that cover only a few examples are referred to as small disjuncts. The problem ...