4835 search results - page 689 / 967 » Refactoring Functional Programs |
106
Voted
ICALP
2007
Springer
15 years 6 months 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...
95
Voted
ICALP
2007
Springer
15 years 6 months 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...
95
Voted
ICALP
2007
Springer
15 years 6 months 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...
115
Voted
ICN
2007
Springer
15 years 6 months ago
2007
Springer
— In this paper, we use the Markov Decision Process (MDP) technique to find the optimal code allocation policy in High-Speed Downlink Packet Access (HSDPA) networks. A discrete ...
IFIP
2007
Springer
15 years 6 months ago
2007
Springer
Capability acquisition graphs (CAGs) provide a powerful framework for modeling insider threats, network attacks and system vulnerabilities. However, CAG-based security modeling sys...