this paper presents a novel multi-agent architecture for meeting scheduling. the proposed architecture is a new Hybrid Multi-Agent Architecture (HMAA) that generates new heuristics for solving NP-hard problems. Moreov...
详细信息
the development status and existing problems of Wuhan East Lake national independent innovative demonstration area was first introduced. In conjunction withthe actual development of the area, the corresponding counte...
详细信息
ISBN:
(纸本)9787562933700
the development status and existing problems of Wuhan East Lake national independent innovative demonstration area was first introduced. In conjunction withthe actual development of the area, the corresponding countermeasures and advices were put forward. the strategies are as follows: 1) focus on the innovation of system and mechanism, carry out the system transition from governmental government to diversified government, and establish the management operation mechanism with small institutions and great services;2) deal with correctly the relationship among the three main bodies, and stress the powerful thrust and promotion role of the government;3) innovate the management system, establish the management operation mechanism withthe features of following the special policies under special circumstances and dealing with special things in special ways, which is suitable for the special administrative region;4) accelerate the technology innovation, combine the independent research and development withthe technology introduction;5) enact the policy system and innovation culture to guide and encourage the formation of industrial cluster, accelerate the cluster of college research personnel and science and technology enterprises. the above countermeasures will facilitate the rapid development of demonstration area.
this paper aims to optimize the PMU (Phasor Measurement Unit) placement for a full observation of the power network and the minimum number of PMUs. In this paper competition of Mixed Integer Non-Linear programming and...
详细信息
ISBN:
(纸本)9789746724913
this paper aims to optimize the PMU (Phasor Measurement Unit) placement for a full observation of the power network and the minimum number of PMUs. In this paper competition of Mixed Integer Non-Linear programming and heuristically algorithms such as Bacterial Foraging Algorithm was presented. the results are demonstrated with PMU placement optimization simulation and a redundancy measurement analysis by using IEEE14-bus and Tehran Regional electric company 41-bus networks.
Withthe development of automotive industry and transportation, the safety of transportation is huge invisible trouble by bringing great convenience to human being for many years. As result, the reappearance for the s...
详细信息
this paper quantitatively studies the trace effects to the performance and accuracy of the BigSim Emulator, a scalable parallel emulator for large-scale computers. To assess the accuracy effect we modify the emulator ...
详细信息
Exploiting solution counting information from individual constraints has led to some of the most efficient search heuristics in constraint programming. However, evaluating the number of solutions for the alldifferent ...
详细信息
ISBN:
(纸本)9783642135194
Exploiting solution counting information from individual constraints has led to some of the most efficient search heuristics in constraint programming. However, evaluating the number of solutions for the alldifferent constraint still presents a challenge: even though previous approaches based on sampling were extremely effective on hard instances, they are not competitive on easy to medium difficulty instances due to their significant computational overhead. In this paper we explore a new approach based on upper bounds, trading counting accuracy for a significant speedup of the procedure. Experimental results show a marked improvement on easy instances and even some improvement on hard instances. We believe that the proposed method is a crucial step to broaden the applicability of solution counting-based search heuristics.
State-of-the-art solvers for mixed integer programming (MIP) problems are highly parameterized, and finding parameter settings that achieve high performance for specific types of MIP instances is challenging. We study...
详细信息
ISBN:
(纸本)9783642135194
State-of-the-art solvers for mixed integer programming (MIP) problems are highly parameterized, and finding parameter settings that achieve high performance for specific types of MIP instances is challenging. We study the application of an automated algorithm configuration procedure to different MIP solvers, instance types and optimization objectives. We show that this fully-automated process yields substantial improvements to the performance of three MIP solvers: CPLEX, GUROBI, and LPSOLVE. Although our method can be used "out of the box" without any domain knowledge specific to MIP, we show that it outperforms the CPLEX special-purpose automated tuning tool.
Because of their self-x properties Organic Computing systems are hard to verify. Nevertheless in safety critical domains one may want to give behavioral guarantees. One technique to reduce complexity of the overall ve...
详细信息
ISBN:
(纸本)9783642165757
Because of their self-x properties Organic Computing systems are hard to verify. Nevertheless in safety critical domains one may want to give behavioral guarantees. One technique to reduce complexity of the overall verification task is applying composition theorem. In this paper we present a technique for formal specification and compositional verification of Organic Computing systems. Separation of self-x and functional behavior has amongst others, advantages for the formal specification. We present how the specification of self-x behavior can be integrated into an approach for compositional verification of concurrent systems, based on Interval Temporal Logic. the presented approach has full tool support withthe KIV interactive theorem prover.
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for a redundant knapsack constraint whic...
详细信息
ISBN:
(纸本)9783642135194
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for a redundant knapsack constraint which is obtained by surrogate relaxation. We then consider a Lagrangian relaxation of the original problem to obtain an initial weight bound on the knapsack. this bound is then refined through subgradient optimization. the latter provides a variety of Lagrange multipliers which allow us to filter infeasible edges in the DP table. the number of paths in the final table then provides an upper bound on the number of solutions. Numerical results show the effectiveness of our counting framework on automatic recording and market split problems.
the paper describes an algorithm that constructs approximate decision trees (alpha-decision trees), which are optimal relatively to one of the following complexity measures: depth, total path length or number of nodes...
详细信息
ISBN:
(纸本)9783642135286
the paper describes an algorithm that constructs approximate decision trees (alpha-decision trees), which are optimal relatively to one of the following complexity measures: depth, total path length or number of nodes. the algorithm uses dynamic programming and extends methods described in [4] to constructing approximate decision trees. Adjustable approximation rate allows controlling algorithm complexity. the algorithm is applied to build optimal alpha-decision trees for two data sets from UCI Machine Learning Repository [1].
暂无评论