Sciweavers

1763 search results - page 167 / 353
» Dependent random choice
Sort
View
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
14 years 1 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...
GECCO
2009
Springer
14 years 26 days ago
Novelty of behaviour as a basis for the neuro-evolution of operant reward learning
An agent that deviates from a usual or previous course of action can be said to display novel or varying behaviour. Novelty of behaviour can be seen as the result of real or appar...
Andrea Soltoggio, Ben Jones
CONCUR
2000
Springer
14 years 18 days ago
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
DCC
1998
IEEE
14 years 15 days ago
Optimal Multiple Description Transform Coding of Gaussian Vectors
Multiple description coding (MDC) is source coding for multiple channels such that a decoder which receives an arbitrary subset of the channels may produce a useful reconstruction...
Vivek K. Goyal, Jelena Kovacevic
SUTC
2010
IEEE
14 years 4 days ago
Link Scheduling in a Single Broadcast Domain Underwater Networks
Because radio waves decay rapidly in sea water, acoustic communication is the most popular choic for underwater sensor networks. However, since the propagation speed of acoustic w...
Pai-Han Huang, Ying Chen, Bhaskar Krishnamachari, ...