Sciweavers

1612 search results - page 73 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
PPSN
2000
Springer
15 years 1 months ago
Practical Implications of New Results in Conservation of Optimizer Performance
Abstract. Three theoretical perspectives upon conservation of performance in function optimization are outlined. In terms of statistical information, performance is conserved when ...
Thomas M. English
ATAL
2009
Springer
15 years 4 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...
ICPR
2008
IEEE
15 years 4 months ago
Graph drawing using quantum commute time
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...
David Emms, Edwin R. Hancock, Richard C. Wilson
CORR
2010
Springer
137views Education» more  CORR 2010»
14 years 10 months ago
State Elimination Ordering Strategies: Some Experimental Results
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
Nelma Moreira, Davide Nabais, Rogério Reis
FGCN
2008
IEEE
240views Communications» more  FGCN 2008»
15 years 4 months ago
Data Compression Algorithm Based on Hierarchical Cluster Model for Sensor Networks
A new distributed algorithm of data ccompression based on hierarchical cluster model for sensor networks is proposed, the basic ideas of which are as follows, firstly the whole se...
Tongsen Wang, Lei Wang, Zhijun Xie, Ronghua Yang