The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
Abstract. We motivate and describe an analog evolvable hardware design platform named GRACE (i.e. Generative Robust Analog Circuit Exploration). GRACE combines coarse-grained, topo...
Michael A. Terry, Jonathan Marcus, Matthew Farrell...
Abstract. An off-line hand-written Chinese character recognizer supporting a vocabulary of 4,616 Chinese characters, alphanumerics and punctuation symbols has been reported. Traine...
—We present a first effort to integrate NLP with ASP for autonomous agents, especially service robots, communicating with humans. We implemented a prototype system and tested it...
Xiaoping Chen, Jiehui Jiang, Jianmin Ji, Guoqiang ...