27 search results - page 2 / 6 » Interval Stabbing Problems in Small Integer Ranges |
103
Voted
CPM
2009
Springer
15 years 7 months ago
2009
Springer
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...
115
Voted
JAIR
2011
14 years 8 months ago
2011
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over i...
199
Voted
ICDE
2005
IEEE
16 years 2 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
108
Voted
COCOON
2005
Springer
15 years 6 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...
105
Voted
IJCAI
1993
15 years 2 months ago
1993
We introduce and use a new methodology for the study of logics for action and change. The methodology allows one to define a taxonomy of reasoning problems, based in particular on...