Abstract. In this paper, we address the problem of providing guidelines to designers of mixed-initiative artificial intelligence systems, which specify when the system should take...
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it eas...
Willem Visser, Klaus Havelund, Guillaume P. Brat, ...
We describe a system called CFLP which aims at the integration of the best features of functional logic programming (FLP), cooperative constraint solving (CCS), and distributed co...
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...