265 search results - page 13 / 53 » et 2000 |
CSR
2009
Springer
13 years 8 months ago
2009
Springer
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
CSUR
2000
13 years 7 months ago
2000
Not only the design of complex frameworks is hard, but also the reuse of such artefacts. Furthermore, the internal working of different frameworks is usually not compatible so that...
STACS
2000
Springer
13 years 11 months ago
2000
Springer
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
DEDS
2000
13 years 7 months ago
2000
We address the problem of failure diagnosis in discrete event systems with decentralized information. We propose a coordinated decentralized architecture consisting of local sites ...
COLT
2001
Springer
14 years 1 days ago
2001
Springer
We prove strong noise-tolerance properties of a potential-based boosting algorithm, similar to MadaBoost (Domingo and Watanabe, 2000) and SmoothBoost (Servedio, 2003). Our analysi...