363 search results - page 36 / 73 » Finding Small Solutions to Small Degree Polynomials |
DAWAK
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
ENDM
2010
13 years 7 months ago
2010
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
TEDU
2011
13 years 2 months ago
2011
In the era of distributed digital media, technology is moving to the background and interoperability between devices increases. The handles for users to explore, make and break con...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
DM
2006
13 years 7 months ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...