Sciweavers

12194 search results - page 2152 / 2439
» Numberings Optimal for Learning
Sort
View
ENTCS
2008
95views more  ENTCS 2008»
15 years 6 months ago
Coverage-biased Random Exploration of Models
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
Marie-Claude Gaudel, Alain Denise, Sandrine-Domini...
CGF
2006
139views more  CGF 2006»
15 years 6 months ago
Pose Controlled Physically Based Motion
In this paper we describe a new method for generating and controlling physically-realistic motion of complex articulated characters. Our goal is to create motion from scratch, whe...
Raanan Fattal, Dani Lischinski
CN
2006
115views more  CN 2006»
15 years 6 months ago
MuSeQoR: Multi-path failure-tolerant security-aware QoS routing in Ad hoc wireless networks
In this paper, we present MuSeQoR: a new multi-path routing protocol that tackles the twin issues of reliability (protection against failures of multiple paths) and security, whil...
Tamma Bheemarjuna Reddy, S. Sriram, B. S. Manoj, C...
159
Voted
COMPUTING
2006
100views more  COMPUTING 2006»
15 years 6 months ago
Interval Arithmetic with Containment Sets
The idea of containment sets (csets) is due to Walster and Hansen, and the theory is mainly due to the first author. Now that floating point computation with infinities is widely a...
John D. Pryce, George F. Corliss
COR
2006
72views more  COR 2006»
15 years 6 months ago
Numerical studies on a paradox for non-cooperative static load balancing in distributed computer systems
Numerical examples of a Braess-like paradox in which adding capacity to a distributed computer system may degrade the performance of all users in the system have been reported. Un...
Said Fathy El-Zoghdy, Hisao Kameda, Jie Li
« Prev « First page 2152 / 2439 Last » Next »