Sciweavers

641 search results - page 43 / 129
» Improved Bounds for Wireless Localization
Sort
View
CGF
2006
136views more  CGF 2006»
13 years 7 months ago
Cache-Efficient Layouts of Bounding Volume Hierarchies
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
Sung-Eui Yoon, Dinesh Manocha
IJSYSC
1998
93views more  IJSYSC 1998»
13 years 7 months ago
A new adaptive control scheme with arbitrary nonlinear inputs
This paper presents a new analysis and design method for model reference adaptive control(MRAC) with arbitrary bounded input nonlinearities. The adaptive algorithm ensures that th...
Wen Yu, Manuel de la Sen
ECAI
2008
Springer
13 years 9 months ago
Justification-Based Non-Clausal Local Search for SAT
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
Matti Järvisalo, Tommi A. Junttila, Ilkka Nie...
IJCAI
2007
13 years 9 months ago
An Information-Theoretic Analysis of Memory Bounds in a Distributed Resource Allocation Mechanism
Multiagent distributed resource allocation requires that agents act on limited, localized information with minimum communication overhead in order to optimize the distribution of ...
Ricardo M. Araujo, Luís C. Lamb
MOBIHOC
2008
ACM
14 years 7 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao