2089 search results - page 94 / 418 » A New Problem in String Searching |
107
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
KES
2010
Springer
14 years 8 months ago
2010
Springer
This paper proposes a new solution to the vehicle routing problem with time windows using an evolution strategy adopting viral infection. The problem belongs to the NP-hard class a...
IROS
2007
IEEE
15 years 4 months ago
2007
IEEE
— A new solution to the Simultaneous Localization and Modelling problem is presented. It is based on the stochastic search of solutions in the state space to the global localizat...
IEAAIE
2001
Springer
15 years 2 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
ICPR
2006
IEEE
15 years 3 months ago
2006
IEEE
Recently, we proposed a fast feature extraction approach denoted FSOM utilizes Self Organizing Map (SOM). FSOM [1] overcomes the slowness of traditional SOM search algorithm. We i...