Results 21 to 30 of about 332,141 (275)
Teaching Discrete Mathematics to Computer Science Students [PDF]
, 2019 Discrete Mathematics is an inevitable part of any undergraduate computer science degree programme. However, computer science students typically find this to be at best a necessary evil with which they struggle to engage. Twenty years ago, we started to address this issue seriously in our university, and we have instituted a number of innovations ...
Faron Moller, Liam O’Reilly
openaire +2 more sources
On the residual solvability of generalized free products of solvable groups
, 2011 In this paper, we study the residual solvability of the generalized free product of solvable groups.Comment: Discrete Mathematics & Theoretical Computer Science, Vol 13 ...
Kahrobaei, Delaram, Majewicz, Stephen
core +2 more sources
Post-surjectivity and balancedness of cellular automata over groups [PDF]
, 2017 We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every pre-image of one is asymptotic to a pre-image of the other.
Capobianco, Silvio +2 more
core +1 more source
, 2017 Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability.
Morin, Pat +2 more
core +1 more source
Heredity for generalized power domination
, 2016 In this paper, we study the behaviour of the generalized power domination number of a graph by small changes on the graph, namely edge and vertex deletion and edge contraction.
Dorbec, Paul +2 more
core +2 more sources
Clifford analysis between continuous and discrete [PDF]
, 2008 Some decades ago D. Knuth et al. have coined concrete mathematics as the blending of CONtinuous and disCRETE math, taking into account that problems of standard discrete mathematics can often be solved by methods based on continuous mathematics ...
Falcão, M. I., Malonek, H. R.
core +1 more source
$2\times 2$ monotone grid classes are finitely based
, 2016 In this note, we prove that all $2 \times 2$ monotone grid classes are finitely based, i.e., defined by a finite collection of minimal forbidden permutations.
Albert, Michael, Brignall, Robert
core +1 more source
International Journal of Adaptive Control and Signal Processing, EarlyView.This work introduces an adaptive human pilot model that captures pilot time‐delay effects in adaptive control systems. The model enables the prediction of pilot–controller interactions, facilitating safer integration and improved design of adaptive controllers for piloted applications.
Abdullah Habboush, Yildiray Yildiz
wiley +1 more source
Advanced Engineering Materials, EarlyView.This study explores the mechanical performance of three auxetic structures, identifying a re‐entrant‐star hybrid as the most effective for impact absorption. Finite element simulations and experiments demonstrate significant gains in energy absorption and flexural strength after geometric optimization. This study investigates the mechanical performance
Malik Hassan +4 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.This article presents a solver‐agnostic domain‐specific language (DSL) for computational structural mechanics that strengthens interoperability in virtual product development. Using a hierarchical data model, the DSL enables seamless exchange between diverse simulation tools and numerical methods.
Martin Rädel +3 more
wiley +1 more source