Results 1  10
of
12,339
Amortized Efficiency of List Update and Paging Rules
, 1985
"... In this article we study the amortized efficiency of the “movetofront” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that movetofront is within a constant factor of optimum amo ..."
Abstract

Cited by 824 (8 self)
 Add to MetaCart
among a wide class of list maintenance rules. Other natural heuristics, such as the transpose and frequency count rules, da not share this property. We generalize our results to show that movetofront is within a constant factor of optimum as long as the access cost is a convex function. We also study
General Listing / pg. 30
, 2007
"... seen here just outside the windows of her practice’s operatories. The rooms look out over a tranquil garden with wildlife, trees, fl owers and an art sculpture, “Shaman of the Benediction”, by Bill Worrell. Read more about Dr. Jones starting on page 18. If you missed our Centennial Annual Meeting in ..."
Abstract
 Add to MetaCart
seen here just outside the windows of her practice’s operatories. The rooms look out over a tranquil garden with wildlife, trees, fl owers and an art sculpture, “Shaman of the Benediction”, by Bill Worrell. Read more about Dr. Jones starting on page 18. If you missed our Centennial Annual Meeting in April, you missed a great time! Over 1,500 people came together for CE, networking, social events, exhibit hall, and to celebrate the 100th birthday of the ODA! Read more about the Centennial meeting and check out a sampling of the many photos taken starting on page 22. Mark your calendar now for the 2008 ODA meeting scheduled for May 15 – 17 in Oklahoma City.
Mining Sequential Patterns: Generalizations and Performance Improvements
 RESEARCH REPORT RJ 9994, IBM ALMADEN RESEARCH
, 1995
"... The problem of mining sequential patterns was recently introduced in [3]. We are given a database of sequences, where each sequence is a list of transactions ordered by transactiontime, and each transaction is a set of items. The problem is to discover all sequential patterns with a userspecified ..."
Abstract

Cited by 759 (5 self)
 Add to MetaCart
The problem of mining sequential patterns was recently introduced in [3]. We are given a database of sequences, where each sequence is a list of transactions ordered by transactiontime, and each transaction is a set of items. The problem is to discover all sequential patterns with a user
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 758 (41 self)
 Add to MetaCart
Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number
The Application of General List Processing Macro in Combination Therapy
"... List is one of the common data structures that we use in our daily work. There are many solutions in SAS to deal with this problem. Most of them will require a series of macro functions to build a general list processing target. After that, we still need to write a special purpose macro for each dif ..."
Abstract
 Add to MetaCart
List is one of the common data structures that we use in our daily work. There are many solutions in SAS to deal with this problem. Most of them will require a series of macro functions to build a general list processing target. After that, we still need to write a special purpose macro for each
An Exact Algorithm for the Generalized List TColoring Problem
, 2013
"... The generalized list Tcoloring is a common generalization of many graph coloring models, including classical coloring, L(p, q)labeling, channel assignment and Tcoloring. Every vertex from the input graph has a list of permitted labels. Moreover, every edge has a set of forbidden differences. We a ..."
Abstract
 Add to MetaCart
The generalized list Tcoloring is a common generalization of many graph coloring models, including classical coloring, L(p, q)labeling, channel assignment and Tcoloring. Every vertex from the input graph has a list of permitted labels. Moreover, every edge has a set of forbidden differences. We
Formal Methods: State of the Art and Future Directions
 ACM Computing Surveys
, 1996
"... ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept, ACM Inc., 1515 Broadway, New York, N ..."
Abstract

Cited by 425 (6 self)
 Add to MetaCart
ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept, ACM Inc., 1515 Broadway, New York
Universal coalgebra: a theory of systems
, 2000
"... In the semantics of programming, nite data types such as finite lists, have traditionally been modelled by initial algebras. Later final coalgebras were used in order to deal with in finite data types. Coalgebras, which are the dual of algebras, turned out to be suited, moreover, as models for certa ..."
Abstract

Cited by 408 (42 self)
 Add to MetaCart
In the semantics of programming, nite data types such as finite lists, have traditionally been modelled by initial algebras. Later final coalgebras were used in order to deal with in finite data types. Coalgebras, which are the dual of algebras, turned out to be suited, moreover, as models
What Is Coefficient alpha? An Examination of Theory and Applications
 Journal of Applied Psychology
, 1993
"... Psychological research involving scale construction has been hindered considerably by a widespread lack of understanding of coefficient alpha and reliability theory in general. A discussion of the assumptions and meaning of coefficient alpha is presented. This discussion is followed by a demonstrat ..."
Abstract

Cited by 393 (0 self)
 Add to MetaCart
Psychological research involving scale construction has been hindered considerably by a widespread lack of understanding of coefficient alpha and reliability theory in general. A discussion of the assumptions and meaning of coefficient alpha is presented. This discussion is followed by a
A Brookstype Theorem for the Generalized List TColoring
, 2003
"... We study the notion of a generalized list Tcoloring which is a common generalization of the channel assignment problem and the Tcoloring. An instance of the generalized list Tcoloring is described by a triple (G; ; t) where G is a graph, is a mapping which assigns the vertices of G lists of n ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study the notion of a generalized list Tcoloring which is a common generalization of the channel assignment problem and the Tcoloring. An instance of the generalized list Tcoloring is described by a triple (G; ; t) where G is a graph, is a mapping which assigns the vertices of G lists
Results 1  10
of
12,339