Results 1  10
of
117,973
Multipartite tournaments with small number of cycles
"... L. Volkmann, Discrete Math. 245 (2002) 1953 posed the following question. Let 4 ≤ m ≤ n. Are there strong npartite tournaments, which are not themselves tournaments, with exactly n − m + 1 cycles of length m? We answer this question in affirmative. We raise the following problem. Given m ∈ {3, 4,. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
L. Volkmann, Discrete Math. 245 (2002) 1953 posed the following question. Let 4 ≤ m ≤ n. Are there strong npartite tournaments, which are not themselves tournaments, with exactly n − m + 1 cycles of length m? We answer this question in affirmative. We raise the following problem. Given m ∈ {3, 4
Strong subtournaments of multipartite tournaments
 AUSTRALAS J. COMBIN
, 1999
"... An orientation of a complete graph is a tournament, and an orientation of a complete npartite graph is an npartite tournament. For each n 2:: 4, there exist examples of strongly connected npartite tournament without any strongly connected subtournaments of order p 2:: 4. If D is a digraph, then l ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
An orientation of a complete graph is a tournament, and an orientation of a complete npartite graph is an npartite tournament. For each n 2:: 4, there exist examples of strongly connected npartite tournament without any strongly connected subtournaments of order p 2:: 4. If D is a digraph
A Methodology for AgentOriented Analysis and Design
, 1999
"... This paper presents a methodology for agentoriented analysis and design. The methodology is general, in that it is applicable to a wide range of multiagent systems, and comprehensive, in that it deals with both the macrolevel (societal) and the microlevel (agent) aspects of systems. The methodol ..."
Abstract

Cited by 812 (12 self)
 Add to MetaCart
. The methodology is founded on the view of a system as a computational organisation consisting of various interacting roles. We illustrate the methodology through a case study (an agentbased business process management system).
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 543 (11 self)
 Add to MetaCart
The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms
Bayesian Network Classifiers
, 1997
"... Recent work in supervised learning has shown that a surprisingly simple Bayesian classifier with strong assumptions of independence among features, called naive Bayes, is competitive with stateoftheart classifiers such as C4.5. This fact raises the question of whether a classifier with less restr ..."
Abstract

Cited by 788 (23 self)
 Add to MetaCart
Recent work in supervised learning has shown that a surprisingly simple Bayesian classifier with strong assumptions of independence among features, called naive Bayes, is competitive with stateoftheart classifiers such as C4.5. This fact raises the question of whether a classifier with less
A Metrics Suite for Object Oriented Design
 IEEE Trans. Softw. Eng
, 1994
"... Given the central role that software development plays in the delivery and application of information technology, managers are increasingly focusing on process improvement in the software development area. This demand has spurred the provision of a number of new and/or improved approaches to softwar ..."
Abstract

Cited by 1079 (3 self)
 Add to MetaCart
new technology for which established practices have yet to be developed. This research addresses these needs through the development and implementation of a new suite of metrics for 00 design. Metrics developed in previous research, while contributing to the field's understanding of software dev
The emotional dog and its rational tail: a social intuitionist approach to moral judgment
 Psychological Review
, 2001
"... This is the manuscript that was published, with only minor copyediting alterations, as: Haidt, J. (2001). The emotional dog and its rational tail: A social intuitionist approach to moral judgment. Psychological Review. 108, 814834 Copyright 2001, American Psychological Association To obtain a repr ..."
Abstract

Cited by 629 (20 self)
 Add to MetaCart
reprint of the final typeset article, please go through your library’s journal services, or contact the author directly Research on moral judgment has been dominated by rationalist models, in which moral judgment is thought to be caused by moral reasoning. Four reasons are given for considering
FAST VOLUME RENDERING USING A SHEARWARP FACTORIZATION OF THE VIEWING TRANSFORMATION
, 1995
"... Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques that req ..."
Abstract

Cited by 541 (2 self)
 Add to MetaCart
casting algorithms because the latter must perform analytic geometry calculations (e.g. intersecting rays with axisaligned boxes). The new scanlineorder algorithm simply streams through the volume and the image in storage order. We describe variants of the algorithm for both parallel and perspective
Algorithms for Scalable Synchronization on SharedMemory Multiprocessors
 ACM Transactions on Computer Systems
, 1991
"... Busywait techniques are heavily used for mutual exclusion and barrier synchronization in sharedmemory parallel programs. Unfortunately, typical implementations of busywaiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become marke ..."
Abstract

Cited by 567 (32 self)
 Add to MetaCart
Busywait techniques are heavily used for mutual exclusion and barrier synchronization in sharedmemory parallel programs. Unfortunately, typical implementations of busywaiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become markedly more pronounced as applications scale. We argue that this problem is not fundamental, and that one can in fact construct busywait synchronization algorithms that induce no memory or interconnect contention. The key to these algorithms is for every processor to spin on separate locallyaccessible ag variables, and for some other processor to terminate the spin with a single remote write operation at an appropriate time. Flag variables may be locallyaccessible as a result of coherent caching, or by virtue of allocation in the local portion of physically distributed shared memory. We present a new scalable algorithm for spin locks that generates O(1) remote references per lock acquisition, independent of the number of processors attempting to acquire the lock. Our algorithm provides reasonable latency in the absence of contention, requires only a constant amount of space per lock, and requires no hardware support other than
High confidence visual recognition of persons by a test of statistical independence
 IEEE Trans. on Pattern Analysis and Machine Intelligence
, 1993
"... Abstruct A method for rapid visual recognition of personal identity is described, based on the failure of a statistical test of independence. The most unique phenotypic feature visible in a person’s face is the detailed texture of each eye’s iris: An estimate of its statistical complexity in a samp ..."
Abstract

Cited by 596 (8 self)
 Add to MetaCart
sample of the human population reveals variation corresponding to several hundred independent degreesoffreedom. Morphogenetic randomness in the texture expressed phenotypically in the iris trabecular meshwork ensures that a test of statistical independence on two coded patterns originating from
Results 1  10
of
117,973