1480 search results - page 237 / 296 » Ants can solve constraint satisfaction problems |
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
In this paper, we address the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations s...
206
click to vote
ISMIS
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. Frequent itemset mining can be regarded as advanced database querying where a user specifies the dataset to be mined and constraints to be satisfied by the discovered i...
CP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
To help unravel the structure of the universe, astronomers have developed systems which observe large clusters of objects at the same time. One such system is the 2-degree field s...
111
click to vote
ICCV
2011
IEEE
13 years 12 months ago
2011
IEEE
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...