Sciweavers

492 search results - page 66 / 99
» The number of possibilities for random dating
Sort
View
ICALP
2007
Springer
14 years 2 months ago
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn...
VALUETOOLS
2006
ACM
128views Hardware» more  VALUETOOLS 2006»
14 years 2 months ago
Relative stability analysis of multiple queues
In this paper we consider a general class of single-server multiqueue systems in which the stability of any single queue can be essentially determined by the queue’s arrival rat...
Sum Lam, Rocky K. C. Chang, Yi Xie
GECCO
2005
Springer
151views Optimization» more  GECCO 2005»
14 years 2 months ago
Backward-chaining genetic programming
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
Riccardo Poli, William B. Langdon
IPTPS
2005
Springer
14 years 2 months ago
A First Look at Peer-to-Peer Worms: Threats and Defenses
Abstract— Peer-to-peer (P2P) worms exploit common vulnerabilities in member hosts of a P2P network and spread topologically in the P2P network, a potentially more effective strat...
Lidong Zhou, Lintao Zhang, Frank McSherry, Nicole ...
ISMIR
2005
Springer
134views Music» more  ISMIR 2005»
14 years 2 months ago
Dynamic Playlist Generation Based on Skipping Behavior
Common approaches to creating playlists are to randomly shuffle a collection (e.g. iPod shuffle) or manually select songs. In this paper we present and evaluate heuristics to ad...
Elias Pampalk, Tim Pohle, Gerhard Widmer