Results 261 to 270 of about 1,241,249 (316)

Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms

SIAM Journal on Discrete Mathematics, 2008
Brooks proved that every connected graph other than a clique or odd cycle can be colored with $\Delta$ colors. Erdos, Rubin, and Taylor (and, independently, Vizing) generalized the theorem of Brooks to list colorings, describing all uncolorable connected graphs in which no vertex has a list smaller than its degree.
Tomás Feder, Pavol Hell, Jing Huang 0007   +2 more
openaire   +1 more source

Stimulus Type and the List Strength Paradigm

Quarterly Journal of Experimental Psychology, 2014
In recognition memory, increasing the strength of studied items does not reduce performance on other items, an effect dubbed the null list strength effect (LSE). While this finding has been replicated many times, it has rarely been tested using stimuli other than single words.
Osth, A., Dennis, S., Kinnell, A.
openaire   +3 more sources

Effects of List Types and Cues on the Learning of Word Lists

Reading Research Quarterly, 1970
GIVES SIX instructional methods for initial reading vocabulary acquisition involving two list types (minimal and maximal) combined with three sources of cue (the word itself, a context cue, a picture cue), using 127 first-graders divided into six treatment groups.
openaire   +1 more source

The Type of Preferences in Ranking Lists

2011
We consider the situation when we dispose several lists of ordered objects (stages, objects etc.) and we use it to create final list of assigned objects or classificated objects. Moreover we permit the continuous inflow of new object and outflow chosen to realization objects.
Piech Henryk, Grzegorz Gawinowski
openaire   +1 more source

A list-type storage technique for alphanumeric information

Communications of the ACM, 1963
A method which is economic in terms of space and time is proposed for the storage and manipulation of character strings of arbitrary length in a fixed word-length computer. The method is illustrated in an application to Algol-type identifiers in an Algol-like block structure.
openaire   +1 more source

List-tracing in systems allowing multiple cell-types

Proceedings of the second ACM symposium on Symbolic and algebraic manipulation - SYMSAC '71, 1971
List-processing systems have each allowed the use of only a single size and configuration of list cell. In this paper a system is described which allows the use of arbitrarily many different sizes and configurations of list cells, possibly not specified until run time.
openaire   +1 more source

Recursive data types – lists

2000
Abstract In this chapter we shall be concerned with arrays of objects of given type, and with how to handle these arrays in a variety of applications in which the ordering of the elements of the array (ie, of the individual objects) matters.
openaire   +1 more source

A Grötzsch-Type Theorem for List Colourings with Impropriety One

Combinatorics, Probability and Computing, 1999
A graph G is m-choosable with impropriety d, or simply (m, d)*-choosable, if, for every list assignment L, where [mid ]L(v)[mid ][ges ]m for every v∈V(G), there exists an L-colouring of G such that each vertex of G has at most d neighbours coloured with the same colour as itself.
openaire   +2 more sources

Detection of list-type sentences

8th European Conference on Speech Communication and Technology (Eurospeech 2003), 2003
Taniya Mishra, Esther Klabbers, Jan P. H. van Santen   +2 more
openaire   +1 more source

An abstract data type for freezable lists and DAGs

1997
We propose an abstract data type for freezable data structures. A frozen data structure is immutable. In contrast to general immutable data structures, freezable data structures can be mutated efficiently until they are frozen. Our abstract data type relies on the Carrier-Rider Pattern and information hiding in a module.
openaire   +1 more source