981 resultados para computer programming


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Performance & Development Solutions (PDS) publishes a variety of newsletters that include some great information about our programs and services. Some of the topics you may find include: Upcoming Seminars Current events or news related to training Recognition of achievements How-to section

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Performance & Development Solutions (PDS) publishes a variety of newsletters that include some great information about our programs and services. Some of the topics you may find include: Upcoming Seminars Current events or news related to training Recognition of achievements How-to section

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Performance & Development Solutions (PDS) publishes a variety of newsletters that include some great information about our programs and services. Some of the topics you may find include: Upcoming Seminars Current events or news related to training Recognition of achievements How-to section

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Performance & Development Solutions (PDS) publishes a variety of newsletters that include some great information about our programs and services. Some of the topics you may find include: Upcoming Seminars Current events or news related to training Recognition of achievements How-to section

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Performance & Development Solutions (PDS) publishes a variety of newsletters that include some great information about our programs and services. Some of the topics you may find include: Upcoming Seminars Current events or news related to training Recognition of achievements How-to section

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Performance & Development Solutions (PDS) publishes a variety of newsletters that include some great information about our programs and services. Some of the topics you may find include: Upcoming Seminars Current events or news related to training Recognition of achievements How-to section

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Performance & Development Solutions (PDS) publishes a variety of newsletters that include some great information about our programs and services. Some of the topics you may find include: Upcoming Seminars Current events or news related to training Recognition of achievements How-to section

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Performance & Development Solutions (PDS) publishes a variety of newsletters that include some great information about our programs and services. Some of the topics you may find include: Upcoming Seminars Current events or news related to training Recognition of achievements How-to section

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The Microbe browser is a web server providing comparative microbial genomics data. It offers comprehensive, integrated data from GenBank, RefSeq, UniProt, InterPro, Gene Ontology and the Orthologs Matrix Project (OMA) database, displayed along with gene predictions from five software packages. The Microbe browser is daily updated from the source databases and includes all completely sequenced bacterial and archaeal genomes. The data are displayed in an easy-to-use, interactive website based on Ensembl software. The Microbe browser is available at http://microbe.vital-it.ch/. Programmatic access is available through the OMA application programming interface (API) at http://microbe.vital-it.ch/api.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present a new unifying framework for investigating throughput-WIP(Work-in-Process) optimal control problems in queueing systems,based on reformulating them as linear programming (LP) problems withspecial structure: We show that if a throughput-WIP performance pairin a stochastic system satisfies the Threshold Property we introducein this paper, then we can reformulate the problem of optimizing alinear objective of throughput-WIP performance as a (semi-infinite)LP problem over a polygon with special structure (a thresholdpolygon). The strong structural properties of such polygones explainthe optimality of threshold policies for optimizing linearperformance objectives: their vertices correspond to the performancepairs of threshold policies. We analyze in this framework theversatile input-output queueing intensity control model introduced byChen and Yao (1990), obtaining a variety of new results, including (a)an exact reformulation of the control problem as an LP problem over athreshold polygon; (b) an analytical characterization of the Min WIPfunction (giving the minimum WIP level required to attain a targetthroughput level); (c) an LP Value Decomposition Theorem that relatesthe objective value under an arbitrary policy with that of a giventhreshold policy (thus revealing the LP interpretation of Chen andYao's optimality conditions); (d) diminishing returns and invarianceproperties of throughput-WIP performance, which underlie thresholdoptimality; (e) a unified treatment of the time-discounted andtime-average cases.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper introduces the approach of using Total Unduplicated Reach and Frequency analysis (TURF) to design a product line through a binary linear programming model. This improves the efficiency of the search for the solution to the problem compared to the algorithms that have been used to date. The results obtained through our exact algorithm are presented, and this method shows to be extremely efficient both in obtaining optimal solutions and in computing time for very large instances of the problem at hand. Furthermore, the proposed technique enables the model to be improved in order to overcome the main drawbacks presented by TURF analysis in practice.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We develop a mathematical programming approach for the classicalPSPACE - hard restless bandit problem in stochastic optimization.We introduce a hierarchy of n (where n is the number of bandits)increasingly stronger linear programming relaxations, the lastof which is exact and corresponds to the (exponential size)formulation of the problem as a Markov decision chain, while theother relaxations provide bounds and are efficiently computed. Wealso propose a priority-index heuristic scheduling policy fromthe solution to the first-order relaxation, where the indices aredefined in terms of optimal dual variables. In this way wepropose a policy and a suboptimality guarantee. We report resultsof computational experiments that suggest that the proposedheuristic policy is nearly optimal. Moreover, the second-orderrelaxation is found to provide strong bounds on the optimalvalue.