Sciweavers

242 search results - page 19 / 49
» Distributed algorithms with dynamical random transitions
Sort
View
FUIN
2008
98views more  FUIN 2008»
15 years 2 months ago
A Restarted Strategy for Efficient Subsumption Testing
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
Ondrej Kuzelka, Filip Zelezný
102
Voted
IJON
2010
138views more  IJON 2010»
15 years 1 months ago
A dynamic Bayesian network to represent discrete duration models
Originally devoted to specific applications such as biology, medicine and demography, duration models are now widely used in economy, finance or reliability. Recent works in var...
Roland Donat, Philippe Leray, Laurent Bouillaut, P...
ISVLSI
2003
IEEE
157views VLSI» more  ISVLSI 2003»
15 years 7 months ago
Joint Minimization of Power and Area in Scan Testing by Scan Cell Reordering
This paper describes a technique for re-ordering of scan cells to minimize power dissipation that is also capable of reducing the area overhead of the circuit compared to a random...
Shalini Ghosh, Sugato Basu, Nur A. Touba
137
Voted
DCOSS
2005
Springer
15 years 4 months ago
An Adaptive Blind Algorithm for Energy Balanced Data Propagation in Wireless Sensors Networks
In this paper, we consider the problem of energy balanced data propagation in wireless sensor networks and we generalise previous works by allowing realistic energy assignment. A n...
Pierre Leone, Sotiris E. Nikoletseas, José ...
COMPGEOM
2010
ACM
15 years 7 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park