Sciweavers

7106 search results - page 327 / 1422
» Restricted Complexity, General Complexity
Sort
View
SIGGRAPH
1991
ACM
15 years 8 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
ASPDAC
2008
ACM
109views Hardware» more  ASPDAC 2008»
15 years 6 months ago
TCG-based multi-bend bus driven floorplanning
Abstract--In this paper, the problem of bus driven floorplanning is addressed. Given a set of modules and bus specifications, a floorplan solution including the bus routes will be ...
Tilen Ma, Evangeline F. Y. Young
JCS
2008
109views more  JCS 2008»
15 years 4 months ago
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...
Ferucio Laurentiu Tiplea, Catalin V. Birjoveanu, C...
JOLLI
2006
123views more  JOLLI 2006»
15 years 4 months ago
Cut and Pay
Abstract. In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce ...
Marcelo Finger, Dov M. Gabbay
JSS
2006
85views more  JSS 2006»
15 years 4 months ago
Effects of context on program slicing
Whether context-sensitive program analysis is more effective than context-insensitive analysis is an ongoing discussion. There is evidence that context-sensitivity matters in comp...
Jens Krinke