Sciweavers

6833 search results - page 213 / 1367
» Some two-character sets
Sort
View
JGT
2011
76views more  JGT 2011»
14 years 11 months ago
Intersections of graphs
Let G and H be two graphs of order n. If we place copies of G and H on a common vertex set, how much or little can they be made to overlap? The aim of this paper is to provide som...
Béla Bollobás, Alex D. Scott
SIAMCO
2010
107views more  SIAMCO 2010»
14 years 11 months ago
Optimal Control under Stochastic Target Constraints
We study a class of Markovian optimal stochastic control problems in which the controlled process Z is constrained to satisfy an a.s. constraint Z (T) G Rd+1 P - a.s. at some fi...
Bruno Bouchard, Romuald Elie, Cyril Imbert
SIGACT
2010
76views more  SIGACT 2010»
14 years 11 months ago
Reconfiguring a state machine
Reconfiguration means changing the set of processes executing a distributed system. We explain several methods for reconfiguring a system implemented using the state-machine appro...
Leslie Lamport, Dahlia Malkhi, Lidong Zhou
ECSQARU
2009
Springer
15 years 8 months ago
Knowledge Base Stratification and Merging Based on Degree of Support
Most operators for merging multiple knowledge bases (where each is a set of formulae) aim to produce a knowledge base as output that best reflects the information available in the ...
Anthony Hunter, Weiru Liu
ICMAS
2000
15 years 6 months ago
The Computational Complexity of Agent Design Problems
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
Michael Wooldridge