1480 search results - page 178 / 296 » Ants can solve constraint satisfaction problems |
161
click to vote
NAACL
2010
15 years 4 months ago
2010
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
159
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— This work considers the problem of transmitting multiple compressible sources over a network with minimum cost. The problem is complicated by the fact that the description of t...
174
click to vote
PPDP
2005
Springer
16 years 1 days ago
2005
Springer
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
154
click to vote
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...
158
click to vote
CP
2005
Springer
16 years 2 days ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...