1322 search results - page 122 / 265 » Parameterized counting problems |
131
click to vote
ISOLA
2007
Springer
15 years 10 months ago
2007
Springer
The testing and formal verification of black box software components is a challenging domain. The problem is even harder when specifications of these components are not available...
146
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We demonstrate a fully automated method for obtaining a closedform approximation of a recursive function. This method resulted from a realworld problem in which we had a ...
154
click to vote
IMR
2003
Springer
15 years 9 months ago
2003
Springer
Generation of surface meshes remains an active research problem despite the many publications addressing this topic. The main issues which must be treated by a good remeshing algo...
181
click to vote
IWPEC
2010
Springer
15 years 2 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
121
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...