11345 search results - page 1884 / 2269 » Foundations of Computer Science |
163
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
161
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
117
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
121
click to vote
ECSQARU
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The problem of merging multiple sources information is central in several domains of computer science. In knowledge representation for artificial intelligence, several a...
127
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The main motivation for using a multi–objective evolutionary algorithm for finding biclusters in gene expression data is motivated by the fact that when looking for biclusters ...