Sciweavers

6251 search results - page 1213 / 1251
» Randomness, Computability, and Density
Sort
View
ILP
2005
Springer
14 years 3 months ago
Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
Yi-Dong Shen, Qiang Yang
IPSN
2005
Springer
14 years 3 months ago
Geographic routing with limited information in sensor networks
Geographic routing with greedy relaying strategies have been widely studied as a routing scheme in sensor networks. These schemes assume that the nodes have perfect information ab...
Sundar Subramanian, Sanjay Shakkottai
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
IVA
2005
Springer
14 years 3 months ago
A Platform Independent Architecture for Virtual Characters and Avatars
this is via the ”Motion Abstraction”. This is a single abstraction that represents any type of animation of a character. Different implementations of the ion can provide very ...
M. Gillies, Vinoba Vinayagamoorthy, D. Robeterson,...
RAID
2005
Springer
14 years 3 months ago
FLIPS: Hybrid Adaptive Intrusion Prevention
Intrusion detection systems are fundamentally passive and fail–open. Because their primary task is classification, they do nothing to prevent an attack from succeeding. An intru...
Michael E. Locasto, Ke Wang, Angelos D. Keromytis,...
« Prev « First page 1213 / 1251 Last » Next »