5214 search results - page 295 / 1043 » The Online Specialization Problem |
163
click to vote
ICCS
2005
Springer
16 years 7 days ago
2005
Springer
Given a sequence A of numbers and two positive integers and k, we study the problem to find k disjoint segments of A, each has length at least , such that their sum of densities i...
178
click to vote
CONCUR
2003
Springer
15 years 12 months ago
2003
Springer
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
161
Voted
RANDOM
2001
Springer
15 years 11 months ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
160
click to vote
ESSOS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present an approach to security requirements engineering, which makes use of special kinds of problem frames that serve to structure, characterize, analyze, and solve ...
155
click to vote
FLAIRS
2004
15 years 8 months ago
2004
The integration of methods of Constraint Programming and Multi-Agent-Systems is discussed in this paper. We describe different agent topologies for Constraint Satisfaction Problem...