4757 search results - page 674 / 952 » Monads for Functional Programming |
166
click to vote
CP
2007
Springer
16 years 23 days ago
2007
Springer
We propose a new top down search-based algorithm for compiling AND/OR Multi-Valued Decision Diagrams (AOMDDs), as representations of the optimal set of solutions for constraint opt...
167
click to vote
ECML
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. A clustering method is presented which can be applied to semantically annotated resources in the context of ontological knowledge bases. This method can be used to discov...
180
click to vote
ICALP
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
174
click to vote
ICALP
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
172
click to vote
ICALP
2007
Springer
16 years 23 days ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...