Abstract. Proactive approaches to scheduling take into account information about the execution time uncertainty in forming a schedule. In this paper, we investigate proactive appro...
Abstract. We propose an analytic approach to approximate the survival probabilities of schemata under multi-point crossover and obtain its closed form. It gives a convenient way to...
Abstract. We investigate whether it is possible to obtain any meaningful type of zero-knowledge proofs using a one-message (i.e., noninteractive) proof system. We show that, under ...
Abstract. In this paper, a computational model of a successful negotiated communication system is presented, in which language agents develop their own meanings in response to thei...
Abstract. The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in...