Sciweavers

3731 search results - page 89 / 747
» cases 2006
Sort
View
65
Voted
DM
2006
83views more  DM 2006»
15 years 18 days ago
A note on k-cop, l-robber games on graphs
We give an algorithmic characterisation of finite cop-win digraphs. The case of k > 1 cops and k l 1 robbers is then reduced to the one cop case. Similar characterisations are ...
Gena Hahn, Gary MacGillivray
IANDC
2010
102views more  IANDC 2010»
14 years 11 months ago
Presenting functors on many-sorted varieties and applications
This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of th...
Alexander Kurz, Daniela Petrisan
102
Voted
FFA
2010
84views more  FFA 2010»
14 years 11 months ago
Generating series for irreducible polynomials over finite fields
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact for...
Arnaud Bodin
JSS
2006
97views more  JSS 2006»
15 years 16 days ago
An empirical study into class testability
In this paper we investigate factors of the testability of object-oriented software systems. The starting point is given by a study of the literature to obtain both an initial mod...
Magiel Bruntink, Arie van Deursen
71
Voted
AUTOMATICA
2006
66views more  AUTOMATICA 2006»
15 years 19 days ago
H2 control of preview systems
The H2-optimal controller for systems with preview, in which the knowledge of external input is available in advance for the controller, is derived. The single input case is first...
Agoes A. Moelja, Gjerrit Meinsma