4103 search results - page 78 / 821 » Some results on the Collatz problem |
181
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
168
click to vote
FPCA
1995
15 years 10 months ago
1995
This paper discusses the derivation of functional programs for grammar analysis problems, such as the Empty problem and the Reachable problem. Grammar analysis problems can be div...
142
click to vote
WSC
1998
15 years 7 months ago
1998
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
156
click to vote
ICAC
2005
IEEE
16 years 20 hour ago
2005
IEEE
We present an architecture for and prototype of a system for quickly detecting software problem recurrences. Re-discovery of the same problem is very common in many large software...
197
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from elli...