Sciweavers

327 search results - page 43 / 66
» Some Elimination Problems for Matrices
Sort
View
111
Voted
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
15 years 7 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
NSPW
2006
ACM
15 years 7 months ago
E-Prime for security: a new security paradigm
This paper details a true and striking paradigm shift: the use of E-Prime for (at least) user-centered security, organizational/enterprise security policies and informal security ...
Steven J. Greenwald
CC
2010
Springer
150views System Software» more  CC 2010»
15 years 8 months ago
Practical Extensions to the IFDS Algorithm
Abstract. This paper presents four extensions to the Interprocedural Finite Distributive Subset (IFDS) algorithm that make it applicable to a wider class of analysis problems. IFDS...
Nomair A. Naeem, Ondrej Lhoták, Jonathan Ro...
CCCG
2008
15 years 3 months ago
Polar Diagram of Moving Objects
Many important problems in Computational Geometry needs to perform some kind of angle processing. The Polar Diagram [4] is a locus approach for problems processing angles. Using t...
Mojtaba Nouri Bygi, Mohammad Ghodsi
95
Voted
MICRO
2000
IEEE
68views Hardware» more  MICRO 2000»
15 years 6 months ago
Efficient checker processor design
The design and implementation of a modern microprocessor creates many reliability challenges. Designers must verify the correctness of large complex systems and construct implemen...
Saugata Chatterjee, Christopher T. Weaver, Todd M....