Sciweavers

3928 search results - page 89 / 786
» order 2006
Sort
View
COMBINATORICS
2000
61views more  COMBINATORICS 2000»
15 years 3 months ago
Where the Typical Set Partitions Meet and Join
The lattice of the set partitions of [n] ordered by refinement is studied. Suppose r partitions p1, . . . , pr are chosen independently and uniformly at random. The probability tha...
Boris Pittel
COMBINATORICS
2002
85views more  COMBINATORICS 2002»
15 years 3 months ago
Parking Functions of Types A and B
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parki...
Philippe Biane
COMBINATORICS
2002
111views more  COMBINATORICS 2002»
15 years 3 months ago
A Density Result for Random Sparse Oriented Graphs and its Relation to a Conjecture of Woodall
We shall prove that for all 3 and > 0 there exists a sparse oriented graph of arbitrarily large order with oriented girth and such that any 1/2 + proportion of its arcs induc...
Jair Donadelli, Yoshiharu Kohayakawa
CUZA
2002
132views more  CUZA 2002»
15 years 3 months ago
Agent-Client Interaction in a Web-Based E-Commerce System
In order for agent technology to fulfill its promise, it must be integrated with other existing technologies. In this paper we address one of the problems occurring in a real-world...
Minor Gordon, Marcin Paprzycki, Violetta Galant
IPM
2000
96views more  IPM 2000»
15 years 3 months ago
Measuring the quality of publications: new methodology and case study
In practice, it is important to evaluate the quality of research, in order to make decisions on tenure, funding, and so on. This article develops a methodology using citations to ...
Jack P. C. Kleijnen, Willem J. H. Van Groenendaal