2446 search results - page 187 / 490 » Choiceless Polynomial Time |
ESOP
2007
Springer
14 years 2 months ago
2007
Springer
In this paper we present an alternative approach to interprocedurally g linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of t...
FSTTCS
2007
Springer
14 years 2 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
IFSA
2007
Springer
14 years 2 months ago
2007
Springer
One of the important components of granular computing is interval computations. In interval computations, at each intermediate stage of the computation, we have intervals of possi...