Sciweavers

1095 search results - page 63 / 219
» Preprocessing of Intractable Problems
Sort
View
FLAIRS
2004
15 years 2 months ago
Developing Task Specific Sensing Strategies Using Reinforcement Learning
Robots that can adapt and perform multiple tasks promise to be a powerful tool with many applications. In order to achieve such robots, control systems have to be constructed that...
Srividhya Rajendran, Manfred Huber
73
Voted
AAAI
1998
15 years 2 months ago
A Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms
Walsh Transforms measure all sources of nonlinear interactions for functions that have a bit representation. There can be exponentially many nonlinear interactions and exactly com...
Soraya B. Rana, Robert B. Heckendorn, L. Darrell W...
UAI
2003
15 years 2 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
114
Voted
IJCAI
1989
15 years 1 months ago
Approximation Algorithms for Temporal Reasoning
We consider a representation for temporal relations between intervals introduced by James Allen, and its associated computational or reasoning problem: given possibly indefinite ...
Peter van Beek
99
Voted
IJNSEC
2008
96views more  IJNSEC 2008»
15 years 22 days ago
Weak Composite Diffie-Hellman
In1985, Shmuley proposed a theorem about intractability of Composite Diffie-Hellman. The theorem of Shmuley may be paraphrased as saying that if there exist a probabilistic polyno...
Kooshiar Azimian, Javad Mohajeri, Mahmoud Salmasiz...