4229 search results - page 235 / 846 » On the Optimality of Spiral Search |
107
Voted
EVOW
2007
Springer
15 years 7 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Time series have been a major topic of interest and analysis for hundreds of years, with forecasting a central problem. A large body of analysis techniques has been developed, par...
101
click to vote
AI
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. In this paper, we study the behaviour of the Scaling and Probabilistic Smoothing (SAPS) dynamic local search algorithm on the unweighted MAXSAT problem. MAX-SAT is a conc...
100
click to vote
EVOW
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
122
click to vote
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
Shunting Inhibitory Artificial Neural Networks (SIANNs) are biologically inspired networks in which the synaptic interactions are mediated via a nonlinear mechanism called shuntin...