Sciweavers

1968 search results - page 217 / 394
» The Complexity of Valued Constraint Models
Sort
View
133
Voted
SIGSOFT
2003
ACM
16 years 2 months ago
ARCHER: using symbolic, path-sensitive analysis to detect memory access errors
Memory corruption errors lead to non-deterministic, elusive crashes. This paper describes ARCHER (ARray CHeckER) a static, effective memory access checker. ARCHER uses path-sensit...
Yichen Xie, Andy Chou, Dawson R. Engler
120
Voted
TROB
2002
138views more  TROB 2002»
15 years 1 months ago
Interference-free polyhedral configurations for stacking
This paper uses a configuration space ( -space) based method to compute interference-free configuration for stacking polyhedral sheet metal parts. This work forms the interference ...
Venkateswara R. Ayyadevara, David A. Bourne, Kenji...
ICC
2007
IEEE
147views Communications» more  ICC 2007»
15 years 8 months ago
Detecting Flooding-Based DDoS Attacks
—A Distributed Denial of Service (DDoS) attack is widely regarded as a major threat for the current Internet because of its ability to create a huge volume of unwanted traffic. ...
Yonghua You, Mohammad Zulkernine, Anwar Haque
134
Voted
CAV
2001
Springer
154views Hardware» more  CAV 2001»
15 years 5 months ago
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
107
Voted
AAAI
1997
15 years 3 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht