16504 search results - page 291 / 3301 » New Problems, New Solutions |
145
click to vote
AUSAI
2004
Springer
16 years 2 days ago
2004
Springer
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism ...
138
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper deals with the problem of finding the optimal sequence of sub-word unit HMMs for a number of given utterances of a word. For this problem we present a new solution bas...
176
click to vote
ICPADS
2005
IEEE
16 years 8 days ago
2005
IEEE
We study decentralised low delay degree-constrained overlay multicast tree construction for single source real-time applications. This optimisation problem is NP-hard even if comp...
184
click to vote
NIPS
2008
15 years 8 months ago
2008
It has been shown that the problem of 1-penalized least-square regression commonly referred to as the Lasso or Basis Pursuit DeNoising leads to solutions that are sparse and there...
170
click to vote
ICCD
2008
IEEE
16 years 3 months ago
2008
IEEE
— The amount of time and resources that have to be spent on debugging of embedded cores continuously increases. Approaches valid 10 years ago can no longer be used due to the var...