Sciweavers

351 search results - page 61 / 71
» Perfect Constraints Are Tractable
Sort
View
SIGGRAPH
1991
ACM
13 years 11 months ago
Coping with friction for non-penetrating rigid body simulation
Algorithms and computational complexity measures for simulating the motion of contacting bodies with friction are presented. The bodies are restricted to be perfectly rigid bodies...
David Baraff
PDPTA
2004
13 years 9 months ago
Design of a Real-Time Scheduler for Kahn Process Networks on Multiprocessor Systems
High-throughput real-time systems require non-standard and costly hardware and software solutions. Modern workstation can represent a credible alternative to develop realtime inte...
Javed Dulloo, Philippe Marquet
SSWMC
2004
13 years 9 months ago
Steganalysis of block-structured stegotext
We study a detection-theoretic approach to steganalysis. The relative entropy between covertext and stegotext determines the steganalyzer's difficulty in discriminating them,...
Ying Wang, Pierre Moulin
COR
2010
155views more  COR 2010»
13 years 7 months ago
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...
Jorge E. Mendoza, Bruno Castanier, Christelle Gu&e...
INFORMS
2008
55views more  INFORMS 2008»
13 years 7 months ago
Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
April K. Andreas, J. Cole Smith