1480 search results - page 154 / 296 » Ants can solve constraint satisfaction problems |
144
click to vote
WWW
2010
ACM
16 years 1 months ago
2010
ACM
We study how to automatically extract tourist trips from large volumes of geo-tagged photographs. Working with more than 8 million of these photographs that are publicly available...
198
click to vote
SARA
2009
Springer
16 years 1 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
163
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Recent studies have shown that machine learning can improve the accuracy of detecting object boundaries in images. In the standard approach, a boundary detector is trained by mini...
146
click to vote
GLOBECOM
2008
IEEE
16 years 29 days ago
2008
IEEE
—The problem of maximizing the sum of the transmit rates while limiting the outage probability below an appropriate threshold is investigated for networks where the nodes have li...
150
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Constraint programming can definitely be seen as a model-driven paradigm. The users write programs for modeling problems. These programs are mapped to executable models to calcula...