Combining several suitable neural networks can enhance the generalization performance of the group when compared to a single network alone. However it remains a largely open question, how best to build a suitable combination of individuals. Jacobs and his colleagues proposed the Mixture of Experts (ME) model, in which a set of neural networks are trained together with a gate network. This tight...

Motion planning is the problem of computing valid paths through an environment. However, because computing exact solutions is intractable, sampling-based algorithms, such as Probabilistic RoadMaps (PRMs), have gained popularity. PRMs compute an approximate mapping of the planning space by sacrificing completeness in favor of efficiency. However, these algorithms have certain bottlenecks that hi...

Constraint Logic Programming (CLP), and its generalization in the cc framework, deene a class of declarative constraint languages combining nondeterministic goal-directed programming with constraint techniques over an arbitrary domain. CLP languages are particularly attractive for combinatorial search problems as they ooer a short development time and a reasonable eeciency. In this paper, we pr...

A low complexity distributed coding scheme is proposed for communications over Rayleigh fading channels. Convolutional Coding (CC) assisted Differential Phase-Shift Keying (DPSK) modulation is employed at the source node for conveying the source signals to two relay nodes as well as to the destination node during the first transmission period. Iterative detection exchanging extrinsic informatio...

We show that our Universe lives in a topological and non-perturbative vacuum state full of large amount hidden quantum hairs, the hairons. will discuss elaborate on theoretical evidences hairs are related to gravitational winding number vacuo. Thus, hairons originated from degrees freedom, holographically stored de Sitter area. The hierarchy Planck scale over Cosmological Constant (CC) is under...

The Multicut problem can be deened as: given a graph G and a collection of pairs of distinct vertices (si; ti) of G, nd a minimum set of edges of G whose removal disconnects each si from the corresponding ti. The fractional Multicut problem is the dual of the well-known Multicommodity Flow problem. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being...

This specification defines conferencing call control features for the Session Initiation Protocol (SIP). This document builds on the Conferencing Requirements and Framework documents to define how a tightly coupled SIP conference works. The approach is explored from the perspective of different user agent (UA) types: conferenceunaware, conference-aware, and focus UAs. The use of Uniform Resourc...