1749 search results - page 258 / 350 » Conditional colorings of graphs |
194
click to vote
DAGSTUHL
1996
15 years 7 months ago
1996
An analysis method for specialization of imperative programs is described in this paper. This analysis is an inter-procedural data flow method operating on control flow graphs and...
165
click to vote
ENTCS
2006
15 years 6 months ago
2006
We propose a format of predicate diagrams for the verification of real-time systems. We consider systems that are defined as extended timed graphs, a format that combines timed au...
166
click to vote
JMLR
2008
15 years 6 months ago
2008
We show how a generic feature selection algorithm returning strongly relevant variables can be turned into a causal structure learning algorithm. We prove this under the Faithfuln...
182
click to vote
DSS
2002
15 years 6 months ago
2002
A thorough understanding of the way in which existing business processes currently practice is essential from the perspectives of both process reengineering and workflow managemen...
199
click to vote
SIAMDM
2010
15 years 4 months ago
2010
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...