Sciweavers

681 search results - page 117 / 137
» General Polynomial Time Decomposition Algorithms
Sort
View
124
Voted
AIPS
2000
15 years 3 months ago
Admissible Heuristics for Optimal Planning
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
Patrik Haslum, Hector Geffner
135
Voted
CRYPTO
2010
Springer
170views Cryptology» more  CRYPTO 2010»
14 years 11 months ago
Securing Computation against Continuous Leakage
We present a general method to compile any cryptographic algorithm into one which resists side channel attacks of the only computation leaks information variety for an unbounded nu...
Shafi Goldwasser, Guy N. Rothblum
150
Voted
JAIR
2010
130views more  JAIR 2010»
14 years 9 months ago
Interactive Cost Configuration Over Decision Diagrams
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of ...
Henrik Reif Andersen, Tarik Hadzic, David Pisinger
134
Voted
EGH
2009
Springer
15 years 11 days ago
Object partitioning considered harmful: space subdivision for BVHs
A major factor for the efficiency of ray tracing is the use of good acceleration structures. Recently, bounding volume hierarchies (BVHs) have become the preferred acceleration st...
Stefan Popov, Iliyan Georgiev, Rossen Dimov, Phili...
106
Voted
DAC
2006
ACM
16 years 3 months ago
Efficient simulation of critical synchronous dataflow graphs
Simulation and verification using electronic design automation (EDA) tools are key steps in the design process for communication and signal processing systems. The synchronous dat...
Chia-Jui Hsu, José Luis Pino, Ming-Yung Ko,...