Sciweavers

8009 search results - page 45 / 1602
» cans 2005
Sort
View
WEA
2005
Springer
100views Algorithms» more  WEA 2005»
15 years 5 months ago
Rounding to an Integral Program
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
Refael Hassin, Danny Segev
WG
2005
Springer
15 years 5 months ago
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that vertices can be assigned various domination powers. Broa...
Pinar Heggernes, Daniel Lokshtanov
XSYM
2005
Springer
107views Database» more  XSYM 2005»
15 years 5 months ago
Checking Functional Dependency Satisfaction in XML
Recently, the issue of functional dependencies in XML (XFDs) have been investigated. In this paper we consider the problem of checking the satisfaction of an XFD in an XML document...
Millist W. Vincent, Jixue Liu
BIRTHDAY
2005
Springer
15 years 5 months ago
A Characterisation of Weak Bisimulation Congruence
This paper shows that weak bisimulation congruence can be characterised as rooted weak bisimulation equivalence, even without making assumptions on the cardinality of the sets of s...
Rob J. van Glabbeek
FM
2005
Springer
108views Formal Methods» more  FM 2005»
15 years 5 months ago
Formal Methods and Testing: Hypotheses, and Correctness Approximations
It has been recognised for a while that formal specifications can bring much to software testing. Numerous methods have been proposed for the derivation of test cases from various ...
Marie-Claude Gaudel