Sciweavers

1578 search results - page 179 / 316
» Algorithmic randomness of continuous functions
Sort
View
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
13 years 10 months ago
Sampling stable marriages: why spouse-swapping won't work
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
Nayantara Bhatnagar, Sam Greenberg, Dana Randall
COMPLEX
2009
Springer
14 years 3 months ago
Epidemic Self-synchronization in Complex Networks
In this article we evaluate an epidemic algorithm for the synchronization of coupled Kuramoto oscillators in complex Peer-to-Peer topologies. The algorithm requires a periodic coup...
Ingo Scholtes, Jean Botev, Markus Esch, Peter Stur...
CEC
2009
IEEE
14 years 1 months ago
Benchmarking and solving dynamic constrained problems
— Many real-world dynamic optimisation problems have constraints, and in certain cases not only the objective function changes over time, but the constraints also change as well....
Trung Thanh Nguyen, Xin Yao
CORR
2010
Springer
150views Education» more  CORR 2010»
13 years 9 months ago
Extraction of Symbolic Rules from Artificial Neural Networks
Although backpropagation ANNs generally predict better than decision trees do for pattern classification problems, they are often regarded as black boxes, i.e., their predictions c...
S. M. Kamruzzaman, Md. Monirul Islam
SPAA
2005
ACM
14 years 2 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner