6562 search results - page 154 / 1313 » Noetherianity and Combination Problems |
164
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
182
click to vote
STOC
2010
ACM
16 years 3 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
168
Voted
WEA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
185
click to vote
JAR
2000
15 years 6 months ago
2000
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
163
Voted
MM
2006
ACM
16 years 3 days ago
2006
ACM
We introduce the challenge problem for generic video indexing to gain insight in intermediate steps that affect performance of multimedia analysis methods, while at the same time...