2436 search results - page 122 / 488 » Comonadic Notions of Computation |
104
click to vote
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
138
click to vote
ICAART
2010
INSTICC
16 years 1 months ago
2010
INSTICC
This article introduces the notion of agreement patterns, which provide a framework for modelling reusable
problem solution descriptions for agreement fulfilment. In particular, t...
BIRTHDAY
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We investigate combinatorial commutation properties for reordering a sequence of two kinds of steps, and for separating wellfoundedness of unions of relations. To that en...
143
click to vote
WG
2009
Springer
15 years 10 months ago
2009
Springer
Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed ...
136
Voted
RTA
2009
Springer
15 years 10 months ago
2009
Springer
Most techniques to automatically disprove termination of term rewrite systems search for a loop. Whereas a loop implies nontermination for full rewriting, this is not necessarily t...