11740 search results - page 297 / 2348 » More Problems in Rewriting |
155
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
The minimization problem for Horn formulas is to find a Horn formula equivalent to a given Horn formula, using a minimum number of clauses. A 2log1−ǫ (n) -inapproximability re...
168
click to vote
LPNMR
2009
Springer
15 years 11 months ago
2009
Springer
For some problems with many solutions, like planning and phylogeny reconstruction, one way to compute more desirable solutions is to assign weights to solutions, and then pick the ...
167
click to vote
SACRYPT
2001
Springer
15 years 11 months ago
2001
Springer
This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more...
173
click to vote
SIGGRAPH
1994
ACM
15 years 10 months ago
1994
ACM
A new algorithm for computing contact forces between solid objects with friction is presented. The algorithm allows a mix of contact points with static and dynamic friction. In co...
177
click to vote
FLAIRS
2008
15 years 9 months ago
2008
There are a lot of approaches for solving planning problems. Many of these approaches are based on `brute force` search methods and do not care about structures of plans previousl...