Sciweavers

2107 search results - page 138 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
119
Voted
JSAC
2007
86views more  JSAC 2007»
15 years 3 months ago
Asymptotically optimal cooperative wireless networks with reduced signaling complexity
Abstract— This paper considers an orthogonal amplify-andforward (OAF) protocol for cooperative relay communication over Rayleigh-fading channels in which the intermediate relays ...
Petros Elia, Frédérique E. Oggier, P...
IJSNET
2008
125views more  IJSNET 2008»
15 years 3 months ago
Minimum-cost sensor arrangement for achieving wanted coverage lifetime
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
Jie Wang, Ning Zhong
133
Voted
CDC
2010
IEEE
141views Control Systems» more  CDC 2010»
14 years 10 months ago
Hybrid moment computation algorithm for biochemical reaction networks
Moment computation is essential to the analysis of stochastic kinetic models of biochemical reaction networks. It is often the case that the moment evolution, usually the first and...
Yun-Bo Zhao, Jongrae Kim, João Pedro Hespan...
108
Voted
ISPD
2000
ACM
139views Hardware» more  ISPD 2000»
15 years 8 months ago
Critical area computation for missing material defects in VLSI circuits
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...
Evanthia Papadopoulou
134
Voted
FPLE
1995
15 years 7 months ago
Basic Proof Skills of Computer Science Students
Computer science students need mathematical proof skills. At our University, these skills are being taught as part of various mathematics and computer science courses. To test the ...
Pieter H. Hartel, Bert van Es, Dick Tromp