Sciweavers

2976 search results - page 522 / 596
» On the bounded integer programming
Sort
View
ICALP
2010
Springer
13 years 9 months ago
Covering and Packing in Linear Space
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
ICALP
2010
Springer
13 years 9 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
ECOOP
2008
Springer
13 years 9 months ago
Practical Object-Oriented Back-in-Time Debugging
Back-in-time debuggers are extremely useful tools for identifying the causes of bugs. Unfortunately the "omniscient" approaches that try to remember all previous states a...
Adrian Lienhard, Tudor Gîrba, Oscar Nierstra...
CDES
2008
123views Hardware» more  CDES 2008»
13 years 9 months ago
R-tree: A Hardware Implementation
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
Xiang Xiao, Tuo Shi, Pranav Vaidya, Jaehwan John L...
VAMOS
2008
Springer
13 years 9 months ago
How complex is my Product Line? The case for Variation Point Metrics
Software Product Lines aim at capturing the variability and commonality of a family of related programs that share a common set of assets. Variation points capture variability on ...
Roberto E. Lopez-Herrejon, Salvador Trujillo