6102 search results - page 254 / 1221 » Generating Optimizing Specializers |
111
Voted
ENDM
2010
15 years 27 days ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
COMBINATORICS
2004
15 years 20 days ago
2004
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipula...
93
Voted
CORR
2009
Springer
14 years 10 months ago
2009
Springer
A choreography describes a transaction in which several principals interact. Since choreographies frequently describe business processes affecting substantial assets, we need a se...
203
Voted
NFM
2011
14 years 7 months ago
2011
Abstract. We present a general scheme for automated instantiation-based invariant discovery. Given a transition system, the scheme produces k-inductive invariants from templates re...
123
Voted
VL
1997
IEEE
15 years 4 months ago
1997
IEEE
This paper shows how language technologies such as the automatic generation of parsers for analyzing user actions and visual parsing can be applied to build a flexible tool specia...