11395 search results - page 1977 / 2279 » Beyond computer science |
156
click to vote
CSR
2007
Springer
16 years 27 days ago
2007
Springer
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
176
click to vote
ERCIMDL
2007
Springer
16 years 27 days ago
2007
Springer
Using keyword search to find relevant objects in digital libraries often results in way too large result sets. Based on the metadata associated with such objects, the faceted sear...
200
click to vote
FROCOS
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...
177
Voted
GECCO
2007
Springer
16 years 27 days ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
157
click to vote
GECCO
2007
Springer
16 years 27 days ago
2007
Springer
In this paper, we describe an experiment to evolve oral tract (mouth) shapes for a set of vowels for two adult males. Target vowels were recorded in an acoustically anechoic room ...