1058 search results - page 168 / 212 » It's Doomed; We Can Prove It |
WAOA
2005
Springer
14 years 3 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
VMCAI
2004
Springer
14 years 3 months ago
2004
Springer
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
FLOPS
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
SIAMCOMP
2010
13 years 8 months ago
2010
Some systems interact with their environment at physically distributed interfaces, called ports, and in testing such a system it is normal to place a tester at each port. Each test...
ANCS
2006
ACM
14 years 3 months ago
2006
ACM
The fast spreading worm is becoming one of the most serious threats to today’s networked information systems. A fast spreading worm could infect hundreds of thousands of hosts w...