Country: Netherlands

Found 18376 papers in total
Automatic ARIMA modeling including interventions, using time series expert software
Automatic ARIMA modeling including interventions, using time series expert software
2000,
This article has three objectives: (a) to describe the method of automatic ARIMA...
Automatic neural network modeling for univariate time series
Automatic neural network modeling for univariate time series
2000,
Artificial neural networks (ANNs) are an information processing paradigm inspired by...
A note on the robust trend and ARARMA methodologies used in the M3 competition
A note on the robust trend and ARARMA methodologies used in the M3 competition
2000,
This brief note describes two of the forecasting methods used in the M3 Competition,...
The theta model: A decomposition approach to forecasting
The theta model: A decomposition approach to forecasting
2000,
This paper presents a new univariate forecasting method. The method is based on the...
On some infinite series of (r,1)-designs
On some infinite series of (r,1)-designs
2000,
( r ,1)-designs are linear spaces with v points where every point lies on exactly r...
Structural aspects of ordered polymatroids
Structural aspects of ordered polymatroids
2000,
This paper generalizes some aspects of polymatroid theory to partially ordered sets....
Recognition of tractable satisfiability problems through balanced polynomial representations
Recognition of tractable satisfiability problems through balanced polynomial representations
2000,
We consider a specific class of satisfiability (SAT) problems, the conjunctions of...
Counting symmetric configurations χ3
Counting symmetric configurations χ3
2000,
In this article we give tables of configurations χ 3 for...
Reduction of symmetric configurations n3
Reduction of symmetric configurations n3
2000,
Symmetric configurations n 3 are equivalent to the bicubic graphs of girth ≥ 6....
Two results on the bit extraction problem
Two results on the bit extraction problem
2000,
An ( n,s,t )-resilient function is a function f : {1,–1} n ÷ {1,–1}...
Petri net modelling and design of task oriented messaging system for robot control
Petri net modelling and design of task oriented messaging system for robot control
1998,
Manufacturing Message Specification (MMS) is an international standard for shop floor...
Development of an adaptive fuzzy behavioural control system with experimental and industrial applications
Development of an adaptive fuzzy behavioural control system with experimental and industrial applications
1998,
This paper discusses a newly developed Adaptive Fuzzy Behavioural Control System which...
Optimal paths in network games with p players
Optimal paths in network games with p players
2000,
The problem of finding the optimal paths in network games with p players, which...
Cyclic graphs
Cyclic graphs
2000,
A subclass of the class of circulant graphs is considered. It is shown that in this...
On the strong chromatic index of cyclic multigraphs
On the strong chromatic index of cyclic multigraphs
2000,
We study the strong chromatic index of multigraphs whose underlying graph is a cycle....
Independent sets with domination constraints
Independent sets with domination constraints
2000,
A ρ-independent set S in a graph is parameterized by a set ρ of non-negative...
Reducible configurations for the cycle double cover conjecture
Reducible configurations for the cycle double cover conjecture
2000,
A CDC (cycle double cover) of a graph G is a system ( C 1 ,...,C k ) of cycles in G...
Connected domination and dominating clique in trapezoid graphs
Connected domination and dominating clique in trapezoid graphs
2000,
The class of trapezoid graphs is a subclass of cocomparability graphs and contains...
Domination and total domination on asteroidal triple-free graphs
Domination and total domination on asteroidal triple-free graphs
2000,
We present the first polynomial time algorithms for solving the NP-complete graph...
Covering a rectangle with six and seven circles
Covering a rectangle with six and seven circles
2000,
In a recent article Heppes and Melissen have determined the thinnest coverings of a...
N-extendible posets, and how to minimize total weighted completion time
N-extendible posets, and how to minimize total weighted completion time
2000,
P 4 -extendible graphs have been introduced by Jamison and Olariu as one of several...
Recognizing k-path graphs
Recognizing k-path graphs
2000,
The k -path graph P k ( H ) of a graph H has all length- k paths of H as vertices; two...
Uncolorable mixed hypergraphs
Uncolorable mixed hypergraphs
2000,
A mixed hypergraph H = ( X ,A,E ) consists of the vertex set X and two families of...
Pancyclic out-arcs of a vertex in tournaments
Pancyclic out-arcs of a vertex in tournaments
2000,
Thomassen proved that every strong tournament contains a vertex x such that each arc...
Papers per page: