16404 search results - page 800 / 3281 » A set coverage problem |
170
click to vote
STOC
1993
ACM
15 years 11 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
192
click to vote
VLDB
1990
ACM
15 years 11 months ago
1990
ACM
Non-monotonic knowledge evolutions and exceptions constitute a complex theoritical and practical problem. The state of the art shows a rich and surprising diversity of approaches....
172
click to vote
IAT
2009
IEEE
15 years 11 months ago
2009
IEEE
This paper addresses a novel coordination problem for distributed agents in a discrete-event setting. We introduce and study a predicate coordination problem as the problem of dist...
186
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
Our paper concerns optimal combinations of different types of reinsurance contracts. We introduce a novel approach based on the Mean-Variance-Criterion to solve this task. Two sta...
219
click to vote
CHARME
2001
Springer
15 years 11 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...