4716 search results - page 830 / 944 » Iterative-free program analysis |
104
click to vote
COR
2010
15 years 4 months ago
2010
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
149
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
117
click to vote
ECCC
2010
15 years 4 months ago
2010
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...
126
click to vote
ENTCS
2008
15 years 4 months ago
2008
Attribute grammar specification languages, like many domain specific languages, offer significant advantages to their users, such as high-level declarative constructs and domain-s...
126
click to vote
FAC
2008
15 years 4 months ago
2008
Abstract. A fundamental method of analyzing a system such as a program or a circuit is invariance analysis, in which one proves that an assertion holds on all reachable states. Typ...