This paper studies optimal power allocation to minimize symbol error rate (SER) of amplify-and-forward cooperative diversity networks. First, we analytically solve optimal power allocation problem to minimize SER for three different scenarios, namely, multi-branch single-relay, single-branch multi-relay and multi-branch multi-relay cooperative diversity networks, all subject to a given total re...

This paper deals with value ordering heuristics used in a complete tree search algorithm for solving binary constraint satisfaction problems. Their aim is to guide the search towards a solution. First, we show the limits of the traditional prospective approach, which uses the size of the domains of the still unassigned variables. In an advantageous context, where arc consistency is maintained a...

We propose a solution technique for scheduling and constraint satisfaction problems that combines backtracking-free constructive methods and local search techniques. Our technique incrementally constructs the solution, performing a local search on part ial solutions each time the construction reaches a dead-end. Local search on the space of partial solutions is guided by a cost function based o...

Researchers agree that error diagnosis is one of the most important components of an Intelligent Tutoring System (ITS). Since in ambitious domains a perfect error diagnosis can not be guaranteed, the diagnostic accuracy of an ITS within an ill-defined domain should attract more attention. In this paper we introduce our constraint-based error diagnosis approach for logic programming and demonstr...

Error bounds for cone inclusion problems in Banach spaces are established under conditions weaker than Robinson’s constraint qualification. The results allow the cone to be more general than the origin and therefore also generalize a classical error bound result concerning equality-constrained sets in optimization. Applications in finite-dimensional differentiable inequalities and in tangent co...

In this paper we study the two-machine owshop scheduling problem with an availability constraint on the rst machine. We rst show that the worst-case error bound 2 of the heuristic provided by Lee [4] is tight. We then develop an improved heuristic with a worst-case error bound of 3 . c © 2000 Elsevier Science B.V. All rights reserved.

This paper addresses the issue of position/force tracking for a constrained robot within the framework of impedance control. An adaptive controller is developed in which a varying desired impedance is adaptively tuned with the robot’s position tracking error. It guarantees the asymptotic convergence of the robot position tracking error and the boundedness of the constraint force tracking error....

A novel constrained formulation for the dynamic subgrid-scale model for large eddy simulation (LES) is proposed. It is employed as a dynamic wall model when the constraint is imposed in the near-wall region of wall-bounded flows. An externally prescribed Reynolds stress is used as the constraint. However, unlike conventional zonal approaches, Reynolds stress is not imposed as the solution, but ...

We analyze an implicit a posteriori error indicator for the time harmonic Maxwell equations and prove that it is both reliable and locally efficient. For the derivation, we generalize some recent results concerning explicit a posteriori error estimates. In particular, we relax the divergence free constraint for the source term. We also justify the complexity of the obtained estimator.

In this paper we shall discuss how to treat the automatic generation of assembly task specifications as a constraint satisfaction problem (CSP) over finite and infinite domains. Conceptually it is straightforward to formulate assembly planning in terms of CSP, however the choice of constraint representation and of the order in which the constraints are applied is nontrivial if a computationally...