86 search results - page 16 / 18 » Combinatorics of generalized q-Euler numbers |
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of intege...
COCOON
2003
Springer
14 years 21 days ago
2003
Springer
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
COMPGEOM
2010
ACM
14 years 17 days ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
FOSSACS
2011
Springer
12 years 11 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...