Sciweavers

1452 search results - page 265 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
FC
2005
Springer
83views Cryptology» more  FC 2005»
14 years 3 months ago
Secure Distributed Human Computation
We suggest a general paradigm of using large-scale distributed computation to solve difficult problems, but where humans can act as agents and provide candidate solutions. We are e...
Craig Gentry, Zulfikar Ramzan, Stuart G. Stubblebi...
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
14 years 2 months ago
Resolution Complete Rapidly-Exploring Random Trees
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
Peng Cheng, Steven M. LaValle
IEEEPACT
2002
IEEE
14 years 2 months ago
Increasing and Detecting Memory Address Congruence
A static memory reference exhibits a unique property when its dynamic memory addresses are congruent with respect to some non-trivial modulus. Extraction of this congruence inform...
Samuel Larsen, Emmett Witchel, Saman P. Amarasingh...
WCRE
2002
IEEE
14 years 2 months ago
Estimating Potential Parallelism for Platform Retargeting
Scientific, symbolic, and multimedia applications present diverse computing workloads with different types of inherent parallelism. Tomorrow’s processors will employ varying com...
Linda M. Wills, Tarek M. Taha, Lewis B. Baumstark ...
AGP
1999
IEEE
14 years 1 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...