Sciweavers

5948 search results - page 242 / 1190
» Computing Robust Counter-Strategies
Sort
View
TOG
2012
246views Communications» more  TOG 2012»
13 years 6 months ago
Continuous penalty forces
We present a simple algorithm to compute continuous penalty forces to determine collision response between rigid and deformable models bounded by triangle meshes. Our algorithm co...
Min Tang, Dinesh Manocha, Miguel A. Otaduy, Ruofen...
RTSS
2007
IEEE
15 years 10 months ago
Robust Priority Assignment for Fixed Priority Real-Time Systems
This paper focuses on priority assignment for realtime systems using fixed priority scheduling. It introduces and defines the concept of a “robust” priority ordering: the most...
Robert I. Davis, Alan Burns
KDD
1995
ACM
85views Data Mining» more  KDD 1995»
15 years 7 months ago
Estimating the Robustness of Discovered Knowledge
This paper introduces a new measurement, robustness, to measure the quality of machine-discovered knowledge from real-world databases that change over time. A piece of knowledge i...
Chun-Nan Hsu, Craig A. Knoblock
EOR
2006
130views more  EOR 2006»
15 years 4 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
TWC
2008
145views more  TWC 2008»
15 years 3 months ago
Robust Optimization Models for Energy-Limited Wireless Sensor Networks under Distance Uncertainty
The distance between nodes in a wireless sensor network (WSN) is an important factor in the performance that can be extracted from the network for many tasks. However, the distanc...
Wei Ye, Fernando Ordóñez