3333 search results - page 419 / 667 » Abstract Proof Search |
179
click to vote
WADS
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
200
click to vote
ANTSW
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
137
click to vote
CP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We introduce a new approach for focusing constraint reasoning using so-called streamlining constraints. Such constraints partition the solution space to drive the search ...
126
click to vote
ECAI
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The basic decision-theoretic troubleshooting task is described in this paper. Dependency sets are defined for a better understanding of dependent actions. It is shown th...
182
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Finding a good wavelet for a particular application and type of input data is a difficult problem. Traditional methods of wavelet deus on abstract properties of the wavelet that ca...