Results 1  10
of
14,060
Generalized Pattern Avoidance with Additional Restrictions
 Sém. Lothar. Combin., B48e
, 2002
"... Babson and Steingrmsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We consider npermutations that avoid the generalized pattern 1 32 and whose k rightmost letters form an increasing subword. ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Babson and Steingrmsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We consider npermutations that avoid the generalized pattern 1 32 and whose k rightmost letters form an increasing subword. The number of such permutations is a linear combination of Bell numbers.
FUZZY TRANSPORTATION PROBLEM WITH ADDITIONAL RESTRICTIONS
"... This paper deals with the transportation problem with additional impurity restrictions where costs are not deterministic numbers but imprecise ones. Here, the elements of the cost matrix are subnormal fuzzy intervals with strictly increasing linear membership functions. By the MaxMin criterion sugg ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper deals with the transportation problem with additional impurity restrictions where costs are not deterministic numbers but imprecise ones. Here, the elements of the cost matrix are subnormal fuzzy intervals with strictly increasing linear membership functions. By the MaxMin criterion
An analysis of transformations
 Journal of the Royal Statistical Society. Series B (Methodological
, 1964
"... In the analysis of data it is often assumed that observations y,, y,,...,y, are independently normally distributed with constant variance and with expectations specified by a model linear in a set of parameters 0. In this paper we make the less restrictive assumption that such a normal, homoscedasti ..."
Abstract

Cited by 1067 (3 self)
 Add to MetaCart
In the analysis of data it is often assumed that observations y,, y,,...,y, are independently normally distributed with constant variance and with expectations specified by a model linear in a set of parameters 0. In this paper we make the less restrictive assumption that such a normal
Pushing the EL envelope
 In Proc. of IJCAI 2005
, 2005
"... Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions, has better algorithmic properties than its counterpart FL0, which allows for conjunction and value restrictions. Whereas the subsumption problem in FL0 becomes already int ..."
Abstract

Cited by 461 (59 self)
 Add to MetaCart
Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions, has better algorithmic properties than its counterpart FL0, which allows for conjunction and value restrictions. Whereas the subsumption problem in FL0 becomes already
Studying information technology in organizations: Research approaches and assumptions
 Information Systems Research
, 1991
"... We examined 155 information systems research articles published from 1983 to 1988 and found that although this research is not rooted in a single overarching theoretical perspective, it does exhibit a single set of philosophical assumptions regarding the nature of the phenomena studied by informatio ..."
Abstract

Cited by 463 (2 self)
 Add to MetaCart
by information systems researchers, and what constitutes valid knowledge about those phenomena. We believe that a single research perspective for studying information systems phenomena is unnecessarily restrictive, and argue that there exist other philosophical assumptions that can inform studies
Interprocedural dataflow analysis via graph reachability
, 1994
"... The paper shows how a large class of interprocedural dataflowanalysis problems can be solved precisely in polynomial time by transforming them into a special kind of graphreachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow fun ..."
Abstract

Cited by 454 (34 self)
 Add to MetaCart
The paper shows how a large class of interprocedural dataflowanalysis problems can be solved precisely in polynomial time by transforming them into a special kind of graphreachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow
Applying New Scheduling Theory to Static Priority PreEmptive Scheduling
 Software Engineering Journal
, 1993
"... The paper presents exact schedulability analyses for realtime systems scheduled at runtime with a static priority preemptive dispatcher. The tasks to be scheduled are allowed to experience internal blocking (from other tasks with which they share resources) and (with certain restrictions) release ..."
Abstract

Cited by 448 (64 self)
 Add to MetaCart
The paper presents exact schedulability analyses for realtime systems scheduled at runtime with a static priority preemptive dispatcher. The tasks to be scheduled are allowed to experience internal blocking (from other tasks with which they share resources) and (with certain restrictions
OnLine QLearning Using Connectionist Systems
, 1994
"... Reinforcement learning algorithms are a powerful machine learning technique. However, much of the work on these algorithms has been developed with regard to discrete finitestate Markovian problems, which is too restrictive for many realworld environments. Therefore, it is desirable to extend these ..."
Abstract

Cited by 381 (1 self)
 Add to MetaCart
Reinforcement learning algorithms are a powerful machine learning technique. However, much of the work on these algorithms has been developed with regard to discrete finitestate Markovian problems, which is too restrictive for many realworld environments. Therefore, it is desirable to extend
ApplicationLevel Multicast Using ContentAddressable Networks
, 2001
"... Most currently proposed solutions to applicationlevel multicast organize the group members into an applicationlevel mesh over which a DistanceVector routing protocol, or a similar algorithm, is used to construct sourcerooted distribution trees. The use of a global routing protocol limits the s ..."
Abstract

Cited by 372 (8 self)
 Add to MetaCart
the scalability of these systems. Other proposed solutions that scale to larger numbers of receivers do so by restricting the multicast service model to be singlesourced. In this paper, we propose an applicationlevel multicast scheme capable of scaling to large group sizes without restricting the service
Results 1  10
of
14,060