Sciweavers

288 search results - page 17 / 58
» random 1998
Sort
View
CP
1998
Springer
15 years 4 months ago
Random Constraint Satisfaction: Theory Meets Practice
Abstract. We study the experimental consequences of a recent theoretical result by Achlioptas et al. that shows that conventional models of random problems are trivially insoluble ...
Ewan MacIntyre, Patrick Prosser, Barbara M. Smith,...
105
Voted
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
15 years 1 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...
TIT
1998
89views more  TIT 1998»
15 years 1 days ago
The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels
—We study the following problem: two agents Alice and Bob are connected to each other by independent discrete memoryless channels. They wish to generate common randomness, i.e., ...
Sivarama Venkatesan, Venkat Anantharam
TIT
1998
78views more  TIT 1998»
15 years 1 days ago
Stationary Markov Random Fields on a Finite Rectangular Lattice
—This paper provides a complete characterization of stationary Markov random fields on a finite rectangular (nontoroidal) lattice in the basic case of a second-order neighborho...
Fréderic Champagnat, Jérôme Id...
125
Voted
IPPS
1998
IEEE
15 years 4 months ago
A Molecular Quasi-Random Model of Computations Applied to Evaluate Collective Intelligence
The paper presents how the Random PROLOG Processor (RPP), a bio-inspired model of computations, can be used for formalization and analysis of a phenomenon - the Collective Intelli...
Tadeusz Szuba