The Discretizable Molecular Distance Geometry Problem (DMDGP) aims to determine the three-dimensional protein structure using distance information from nuclear magnetic resonance experiments. DMDGP has a finite number of candidate solutions and can be solved by combinatorial methods. We describe quantum approach Grover's algorithm with an appropriate oracle function, which is more efficient tha...

Vendor selection decisions are complicated by the fact that various conflicting multi-objective factors must be considered in the decision making process. The problem of vendor selection becomes still more compli-cated with the inclusion of incremental discount pricing schedule. Such hard combinatorial problems when solved using meta heuristics produce near optimal solutions. This paper propose...

The rapid generation of material libraries with multidimensional gradients is important for the discovery new functional materials. Here we report an integrated fabrication scheme, based on glancing angle physical vapor deposition, to form a thin-film materials library controlled variations in nanoshape, multinary composition, and oxidation state single large area substrate. We demonstrate vers...

Cloud computing is a demanding business platform for services related to the field of IT. The goal cloud customers access resources at sustainable price, while suppliers maximize their utilization. Previously, would bid every single resource type, which was limitation allocation. To solve these issues, researchers have focused on combinatorial auction in are offered by providers bundles so that...

In previous chapters we have seen the definition of a constant factor approximation algorithm. In this chapter, we will introduce the notion of a polynomial time approximation scheme (PTAS), which allows approximability to any required degree. To illustrate how PTAS works, we will study two examples, including the knapsack problem and the bin packing problem. The dynamic programming technique w...

Although combinatorial auctions have received a great deal of attention from the computer science community over the past decade, research in this domain has focussed on settings in which a bidder only has preferences over the bundles of goods they themselves receive, and is indifferent about how other goods are allocated to other bidders. In general, however, bidders in combinatorial auctions ...

This paper defines a new category of combinatorial modules. These are overlapping collections of small categories indexed by a directed set. They are specialized in applications to non-commuting rings acting on overlapping modules. Each combinatorial module is associated with an Abelian category of group valued sheaves which is its combinatorial scheme. An adaptation of Čech cohomology is used ...

OBJECTIVES The therapeutic scheme for non-small cell lung cancer (NSCLC) patients can be improved if adapted to the individual response. For example, 60-70% of adenocarcinoma patients show response to EGFR-tyrosine kinase inhibitors in the presence of mutated EGFR. We searched for additional target molecules involved in the action of the EGFR-tyrosine kinase inhibitor erlotinib in the absence o...

Although combinatorial auctions have received a great deal of attention from the computer science community over the past decade, research in this domain has focused on settings in which a bidder only has preferences over the bundles of goods they themselves receive, and is indifferent about how other goods are allocated to other bidders. In general, however, bidders in combinatorial auctions w...

In an electronic marketplace coalition formation allows buyers to enjoy a price discount for each item while combinatorial auction enables buyers to place bids for a bundle of items that are complementary. Coalition formation and combinatorial auction both help to improve the e ciency of a market and have received much attention from economists and computer scientists. But neither in laboratori...