711 search results - page 82 / 143 » Amalgams of Constraint Satisfaction Problems |
155
click to vote
MATES
2009
Springer
15 years 11 months ago
2009
Springer
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
127
Voted
RECOMB
2004
Springer
16 years 4 months ago
2004
Springer
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
147
click to vote
EUROGP
1999
Springer
15 years 9 months ago
1999
Springer
In this paper we describe how the Stepwise Adaptation of Weights (saw) technique can be applied in genetic programming. The saw-ing mechanism has been originally developed for and ...
117
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Computer Supported Cooperative Work (CSCW) defines software tools and technology to support groups of people working together on a project, often at different sites [5]. In this wo...
233
Voted
GIS
2007
ACM
2007
ACM
Exploiting automatically inferred constraint-models for building identification in satellite imagery
16 years 5 months ago
The building identification (BID) problem is based on a process that uses publicly available information to automatically assign addresses to buildings in satellite imagery. In pr...