1322 search results - page 139 / 265 » Parameterized counting problems |
CC
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enum...
COCO
2005
Springer
14 years 3 months ago
2005
Springer
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
COMPGEOM
2010
ACM
14 years 3 months ago
2010
ACM
We present new bounds on the first selection lemma in R3 . This makes progress on the open problems of Bukh, Matoušek and Nivash [6] and Boros-Füredi [4] for the three-dimensio...
COCOON
2010
Springer
14 years 2 months ago
2010
Springer
The main purpose of this paper is to introduce the idea of tatami tilings, and to present some of the many interesting and fun questions that arise when studying them. Roughly spea...
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
— Interested in Evolutionary Robotics, this paper focuses on the acquisition and exploitation of memory skills. The targeted task is a well-studied benchmark problem, the Tolman ...