Sciweavers

1523 search results - page 249 / 305
» Partially ordered secretaries
Sort
View
CLEIEJ
2002
113views more  CLEIEJ 2002»
15 years 13 days ago
The MT Stack: Paging Algorithm and Performance in a Distributed Virtual Memory System
Advances in parallel computation are of central importance to Artificial Intelligence due to the significant amount of time and space their programs require. Functional languages ...
Marco T. Morazán, Douglas R. Troeger, Myles...
83
Voted
MOC
2000
173views more  MOC 2000»
15 years 12 days ago
Computation of Gauss-Kronrod quadrature rules
Recently Laurie presented a new algorithm for the computation of (2n+1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. This algorithm first determines a...
Daniela Calvetti, Gene H. Golub, William B. Gragg,...
94
Voted
CORR
1998
Springer
82views Education» more  CORR 1998»
15 years 9 days ago
Name Strategy: Its Existence and Implications
It is argued that colour name strategy, object name strategy, and chunking strategy in memory are all aspects of the same general phenomena, called stereotyping, and this in turn ...
Mark D. Roberts
JCB
2002
131views more  JCB 2002»
15 years 9 days ago
Modeling and Simulation of Genetic Regulatory Systems: A Literature Review
In order to understand the functioning of organisms on the molecular level, we need to know which genes are expressed, when and where in the organism, and to which extent. The reg...
Hidde de Jong
MP
1998
108views more  MP 1998»
15 years 8 days ago
Base polytopes of series-parallel posets: Linear description and optimization
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
Rainer Schrader, Andreas S. Schulz, Georg Wambach