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,...
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
Abstract. Effective encoding of information is one of the keys to qualitative problem solving. Our aim is to explore Knowledge representation techniques that capture meaningful wor...
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...