Sciweavers

96 search results - page 8 / 20
» Linearity, Non-determinism and Solvability
Sort
View
CORR
2008
Springer
123views Education» more  CORR 2008»
13 years 7 months ago
On the graph isomorphism problem
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is relate...
Shmuel Friedland
APPML
2006
65views more  APPML 2006»
13 years 7 months ago
A numerical scheme for regularized anisotropic curve shortening flow
Realistic interfacial energy densities are often non-convex, which results in backward parabolic behavior of the corresponding anisotropic curve shortening flow, thereby inducing ...
Frank Haußer, Axel Voigt
TOCL
2011
87views more  TOCL 2011»
13 years 2 months ago
The tractability of model checking for LTL: The good, the bad, and the ugly fragments
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
Michael Bauland, Martin Mundhenk, Thomas Schneider...
MP
2010
92views more  MP 2010»
13 years 2 months ago
Single item lot-sizing with non-decreasing capacities
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, cons...
Yves Pochet, Laurence A. Wolsey
DAGSTUHL
2006
13 years 9 months ago
On Complexity of Optimized Crossover for Binary Representations
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
Anton V. Eremeev