Sciweavers

4378 search results - page 247 / 876
» On the Complexity of Ordered Colourings
Sort
View
JCSS
2008
96views more  JCSS 2008»
15 years 6 months ago
A combinatorial characterization of resolution width
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
Albert Atserias, Víctor Dalmau
SIAMSC
2008
133views more  SIAMSC 2008»
15 years 6 months ago
Numerical Variational Methods Applied to Cylinder Buckling
We review and compare different computational variational methods applied to a system of fourth order equations that arises as a model of cylinder buckling. We describe both the di...
Jirí Horák, Gabriel J. Lord, Mark A....
TCOS
2008
15 years 6 months ago
On Contemporary Denotational Mathematics for Computational Intelligence
Denotational mathematics is a category of expressive mathematical structures that deals with high-level mathematical entities beyond numbers and sets, such as abstract objects, com...
Yingxu Wang
TEC
2008
135views more  TEC 2008»
15 years 6 months ago
Quantum Genetic Optimization
Abstract--The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness f...
Andrea Malossini, Enrico Blanzieri, T. Calarco
JSW
2007
126views more  JSW 2007»
15 years 6 months ago
Supporting UML Sequence Diagrams with a Processor Net Approach
— UML sequence diagrams focus on the interaction between different classes. For distributed real time transaction processing it is possible to end up with complex sequence diagra...
Tony Spiteri Staines