Sciweavers

426 search results - page 57 / 86
» The Distribution of Patterns in Random Trees
Sort
View
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
14 years 4 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
AINA
2010
IEEE
14 years 4 days ago
The Power of Orientation in Symmetry-Breaking
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
Satya Krishna Pindiproli, Kishore Kothapalli
GECCO
2000
Springer
200views Optimization» more  GECCO 2000»
13 years 11 months ago
Chemical Crossover
During chemical reactions, molecules interact to produce new molecules. Some of the reaction mechanisms are very close to the way gene combine to produce new genes. Like the class...
Hugues Bersini
JNS
2010
61views more  JNS 2010»
13 years 5 months ago
Validity and Failure of the Boltzmann Approximation of Kinetic Annihilation
This paper introduces a new method to show the validity of a continuum description for the deterministic dynamics of many interacting particles. Here the many particle evolution is...
Karsten Matthies, Florian Theil
COLING
1992
13 years 8 months ago
Preferred Argument Structure For Discourse Understanding
The main purpose of communication is to exchange information. Any discourse understanding model should be able to process the flow of information throughout the entire text. Accor...
Ka-Wai Chui