Sciweavers

4451 search results - page 670 / 891
» On Random Ordering Constraints
Sort
View
COMBINATORICS
2000
96views more  COMBINATORICS 2000»
15 years 6 months ago
Automorphisms and Enumeration of Switching Classes of Tournaments
Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a subset Y such that T2 arises from T1 by switching all arcs between Y and its comp...
László Babai, Peter J. Cameron
CORR
2000
Springer
67views Education» more  CORR 2000»
15 years 6 months ago
The dynamics of iterated transportation simulations
Abstract: Iterating between a router and a traffic micro-simulation is an increasibly accepted method for doing traffic assignment. This paper, after pointing out that the analytic...
Kai Nagel, Marcus Rickert, Patrice M. Simon, Marti...
CORR
2002
Springer
123views Education» more  CORR 2002»
15 years 6 months ago
Survey propagation: an algorithm for satisfiability
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
Alfredo Braunstein, Marc Mézard, Riccardo Z...
SIAMAM
2000
78views more  SIAMAM 2000»
15 years 6 months ago
Spatial Noise Stabilizes Periodic Wave Patterns in Oscillatory Systems on Finite Domains
Invasions in oscillatory systems generate in their wake spatiotemporal oscillations, consisting of either periodic wavetrains or irregular oscillations that appear to be spatiotemp...
Alison L. Kay, Jonathan A. Sherratt
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
15 years 6 months ago
A Note on the Expected Time for Finding Maxima by List Algorithms
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...
Luc Devroye