نتایج جستجو برای: target optimization

تعداد نتایج: 704848  

Journal: :International Journal of Distributed Sensor Networks 2014

Journal: :CoRR 2010
Mirco Gelain Maria Silvia Pini Francesca Rossi Kristen Brent Venable Toby Walsh

The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to any two-sided market. In the classical formulation, n men and n women express their preferences (via a strict total order) over the members of the other sex. Solving a SM problem means finding a stable marriage ...

2008
Timothy W. Albrecht Kenneth W. Bauer

A fundamental problem facing the designers of automatic target recognition (ATR) systems is how to deal with out-of-library or non-registered targets. This research extends a mathematical programming framework that selects the optimal classifier ensemble and fusion method across multiple decision thresholds subject to classifier performance constraints. The extended formulation includes treatme...

Journal: :JACIC 2009
Azad M. Madni Mircea Andrecut

The Weapon Target Assignment (WTA) problem is a fundamental defense application of operations research. The problem consists of optimally assigning a given number of weapons to a set of targets so that the post-engagement total expected survival value of the targets is minimized. Since the WTA problem is known to be NP-complete, there are no exact methods to solve it. This paper presents two in...

2002
Ian P. Gent Patrick Prosser

We present the first complete algorithm for the SMTI problem, the stable marriage problem with ties and incomplete lists. We do this in the form of a constraint programming encoding of the problem. With this we are able to carry out the first empirical study of the complete solution of SMTI instances. In the stable marriage problem (SM) [5] we have men and women. Each man ranks the women, givin...

2002
Koji Inoue Vasily G. Moshnyaga Kazuaki Murakami

This paper proposes an architecture for low-power direct-mapped instruction caches, called “history-based tag-comparison (HBTC) cache”. The HBTC cache attempts to detect and omit unnecessary tag checks at run time. Execution footprints are recorded in an extended BTB (Branch Target Buffer), and are used to know the cache residence of target instructions before starting cache access. In our simu...

2005
Eskindir Asmare Stefan Schmid Marcus Brunner

Service specific overlays are overlay networks build and setup for a single service. Since different services need different types of overlays, the setup process is pretty different. Current approaches normally allow a customer to send in an overlay specification into the overlay provisioning system (mainly centralized). In our approach, we use pattern-based management in order to run the proce...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید