692 search results - page 13 / 139 » Combinatorics of Partial Derivatives |
LATA
2010
Springer
14 years 1 months ago
2010
Springer
The problem of classifying all the avoidable binary patterns in words has been completely solved (see Chapter 3 of M. Lothaire, Algebraic Combinatorics on Words, Cambridge Universi...
COCOON
2005
Springer
14 years 3 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
COCOON
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In this paper, we consider two types of inverse sorting problems. The first type is an inverse sorting problem under weighted Hamming distance with bound constraints, wh...
ICML
1990
IEEE
14 years 2 months ago
1990
IEEE
Given an adequate simulation model of the task environment and payoff function that measures the quality of partially successful plans, competition-based heuristics such as geneti...
CSDA
2007
13 years 10 months ago
2007
A parametric, continuous-time Markov model for digraph panel data is considered. The parameter is estimated by the method of moments. A convenient method for estimating the varian...