Increasing teamwork between agents typically increases the performance of a multi-agent system, at the cost of increased communication and higher computational complexity. This work examines joint actions in the context of a multi-agent optimization problem where agents must cooperate to balance exploration and exploitation. Surprisingly, results show that increased teamwork can hurt agent perf...

This paper investigates the tradeoff between reliability and effectiveness for the IPv4 Zeroconf protocol, proposed by Cheshire/Adoba/Guttman in 2002, dedicated to the selfconfiguration of IP network interfaces. We develop a simple stochastic cost model of the protocol, where reliability is measured in terms of the probability to avoid an address collision after configuration, while effectivene...

For the purpose of solving the flexible job-shop scheduling problem (FJSP), an improved quantum genetic algorithm based on earliness/tardiness penalty coefficient is proposed in this paper. For minimizing the completion time and the job-shop cost, a simulation model was established firstly. Next, according to the characteristics of the due in production, a double penalty coefficient was designe...

This paper suggests the operation polices of storage devices to limiting ramp rates of wind power output. Operation polices are based on the optimization framework of linear programming under the assumption that there is a penalty cost for deviating outside ramp rate limits. Policies decide optimal storage operations to minimize the total penalty costs incurred when violating ramp rate limits. ...

In a rapidly changing and highly uncertain environment, Petri net-based project management systems can be used in the rescheduling (control reconfiguration) of projects, when unforeseen changes occur or new data estimates become available. However, having to reschedule the project after it has started can result in significant suboptimality due to increased cost. In this paper, we present a sol...

In the parallel batch schedulingmodel, a group of jobs can be scheduled together as a batch while the processing time of this batch is the greatest processing time among its members; in the model of scheduling with rejection, any job can be rejected with a corresponding penalty cost added to the objective value. In this paper, we present a PTAS for the combined model of the above two scheduling...

Increasing teamwork between agents typically increases the performance of a multi-agent system, at the cost of increased communication and higher computational complexity. This work examines joint actions in the context of a multi-agent optimization problem where agents must cooperate to balance exploration and exploitation. Surprisingly, results show that increased teamwork can hurt agent perf...

A novel post-synthesis analysis tool is presented which evaluates quality of the organic preparation based on yield, cost, safety, conditions and ease of workup/purification. The proposed approach is based on assigning a range of penalty points to these parameters. This semi-quantitative analysis can easily be modified by other synthetic chemists who may feel that some parameters should be assi...

In this paper, we investigate an a posteriori error estimate of a control constrained optimal control problem governed by a time-dependent convection diffusion equation. Control constraints are handled by using the primal-dual active set algorithm as a semi-smooth Newton method or by adding a Moreau-Yosida-type penalty function to the cost functional. An adaptive mesh refinement indicated by a ...

We consider the problem of choosing between several models in least-squares regression with heteroscedastic data. We prove that any penalization procedure is suboptimal when the penalty is proportional to the dimension of the model, at least for some typical heteroscedastic model selection problems. In particular, Mallows’ Cp is suboptimal in this framework, as well as any “linear” penalty depe...