1480 search results - page 288 / 296 » Ants can solve constraint satisfaction problems |
PR
2006
13 years 10 months ago
2006
Many computer vision and pattern recognition algorithms are very sensitive to the choice of an appropriate distance metric. Some recent research sought to address a variant of the...
ISCAS
2008
IEEE
14 years 5 months ago
2008
IEEE
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
ECWEB
2005
Springer
14 years 4 months ago
2005
Springer
: E-commerce customers may have a problem when paying for the purchase of a major item, if its price is larger than the available credit on their credit card. In the brick and mort...
SIGMOD
2010
ACM
14 years 3 months ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
JAIR
2007
13 years 10 months ago
2007
Numerous formalisms and dedicated algorithms have been designed in the last decades to model and solve decision making problems. Some formalisms, such as constraint networks, can ...