نتایج جستجو برای: optimizing

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

2016
Zhe Wang Ling-Yu Duan Junsong Yuan Tiejun Huang Wen Gao

We present a novel approach called Minimal Reconstruction Bias Hashing (MRH) to learn similarity preserving binary codes that jointly optimize both projection and quantization stages. Our work tackles an important problem of how to elegantly connect optimizing projection with optimizing quantization, and to maximize the complementary effects of two stages. Distinct from previous works, MRH can ...

2001
Michael Paleczny Christopher A. Vick Cliff Click

The Java HotSpot Server Compiler achieves improved asymptotic performance through a combination of ob− ject−oriented and classical−compiler optimizations. Aggressive inlining using class−hierarchy analysis reduces function call overhead and provides opportunities for many compiler optimizations.

Journal: :Softw., Pract. Exper. 1991
Pohua P. Chang Scott A. Mahlke Wen-mei W. Hwu

This paper describes the design and implementation of an optimizing compiler that automatically generates profile information to assist classic code optimizations. This compiler contains two new components, an execution profiler and a profile-based code optimizer, which are not commonly found in traditional optimizing compilers. The execution profiler inserts probes into the input program, exec...

2003
Mohan Rajagopalan Saumya K. Debray Matti A. Hiltunen Richard D. Schlichting

Execution of a program almost always involves multiple address spaces, possibly across separate machines. Here, an approach to reducing such costs using compiler optimization techniques is presented. This paper elaborates on the overall vision, and as a concrete example, describes how this compiler assisted approach can be applied to the optimization of system call performance on a single host....

Journal: :Electronic Notes in Discrete Mathematics 2007
Yannick Frein Benjamin Lévêque András Sebö

We consider the problem of minimizing the size of a family of sets G such that every subset of {1, . . . , n} can be written as a disjoint union of at most k members of G, where k and n are given numbers. This problem originates in a real-world application aiming at the diversity of industrial production. At the same time, the minimum of |G| so that every subset of {1, . . . , n} is the union o...

2015
Katalin Tóth Tamás Bűdi Ádám Kiss Manna Temesvári Edit Háfra Andrea Nagy Zsuzsa Szever Katalin Monostory

1 Phenoconversion of CYP2C9 in epilepsy limits the predictive value of 2 CYP2C9 genotype in optimizing valproate therapy 3 4 Katalin Tóth*, Tamás Bűdi*, Ádám Kiss, Manna Temesvári, Edit Háfra, Andrea Nagy, 5 Zsuzsa Szever, Katalin Monostory 6 7 1 Research Centre for Natural Sciences, Hungarian Academy of Sciences 8 Magyar Tudósok 2, H-1117 Budapest, Hungary 9 2 2 Department of Pediatrics, Semme...

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

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