Sciweavers

2082 search results - page 54 / 417
» Change Paths in Reasoning!
Sort
View
CORR
2007
Springer
93views Education» more  CORR 2007»
13 years 7 months ago
Solving the Hamiltonian path problem with a light-based computer
Abstract. In this paper we suggest the use of light for performing useful computations. Namely, we propose a special computational device which uses light rays for solving the Hami...
Mihai Oltean
PEPM
2010
ACM
14 years 4 months ago
Context-sensitive analysis of obfuscated x86 executables
A method for context-sensitive analysis of binaries that may have obfuscated procedure call and return operations is presented. Such binaries may use operators to directly manipul...
Arun Lakhotia, Davidson R. Boccardo, Anshuman Sing...
ISSS
1999
IEEE
157views Hardware» more  ISSS 1999»
13 years 12 months ago
Bit-Width Selection for Data-Path Implementations
Specifications of data computations may not necessarily describe the ranges of the intermediate results that can be generated. However, such information is critical to determine t...
Carlos Carreras, Juan A. López, Octavio Nie...
TABLEAUX
1999
Springer
13 years 12 months ago
Merge Path Improvements for Minimal Model Hyper Tableaux
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
Peter Baumgartner, Joseph Douglas Horton, Bruce Sp...
AAAI
2012
11 years 10 months ago
A Multi-Path Compilation Approach to Contingent Planning
We describe a new sound and complete method for compiling contingent planning problems with sensing actions into classical planning. Our method encodes conditional plans within a ...
Ronen I. Brafman, Guy Shani