Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
52
MIPS: analysis and annotation of proteins from whole genomes
- Nucleic Acids Res
, 2004
"... resources related to genome information. Manually curated databases for several reference organisms are maintained. Several of these databases are described elsewhere in this and other recent NAR database issues. In a complementary effort, a comprehensive set of.400 genomes automatically annotated w ..."
Abstract
-
Cited by 206 (14 self)
- Add to MetaCart
with the PEDANT system are maintained. The main goal of our current work on creating and maintaining genome databases is to extend gene centered information to information on interactions within a generic comprehensive framework. We have concentrated our efforts along three lines (i) the development of suitable
MIP models for MIP heuristics
, 2006
"... Modern MIP solvers exploit a rich arsenal of tools to attack hard problems, some of which include the solution of LP models to control the branching strategy (strong branching), the cut generation (lift-and-project), the heuristics (reduced costs), etc. As a matter of fact, it is well understood by ..."
Abstract
- Add to MetaCart
” (MIPping) some crucial decisions to be taken within a MIP algorithm. In particular, we will address the possible benefits deriving from the use of an black-box MIP solver to produce heuristic primal solutions for a generic MIP. We will first review the so-called local branching [1] and RINS [2] paradigms
Checking Computations in Polylogarithmic Time
, 1991
"... . Motivated by Manuel Blum's concept of instance checking, we consider new, very fast and generic mechanisms of checking computations. Our results exploit recent advances in interactive proof protocols [LFKN92], [Sha92], and especially the MIP = NEXP protocol from [BFL91]. We show that every no ..."
Abstract
-
Cited by 260 (10 self)
- Add to MetaCart
. Motivated by Manuel Blum's concept of instance checking, we consider new, very fast and generic mechanisms of checking computations. Our results exploit recent advances in interactive proof protocols [LFKN92], [Sha92], and especially the MIP = NEXP protocol from [BFL91]. We show that every
MIPS Final Report
"... Description Language (SADL) which forces providers and clients of a service to share the same service definition. The software plugs, ensuring the communication among the processes and the marshalling and un-marshalling of the data structures passed as parameters, are generated automatically by the ..."
Abstract
- Add to MetaCart
by the Software Bus SADL compiler in C or C++, for UNIX processes or MS-Windows tasks, for server or client components, on demand. The adoption of the Software Bus allowed the easy physical re-distribution of the MIPS processes among several servers and the replication of subsystems of intercommunicating
MIPS: a database for protein sequences and complete genomes
, 1998
"... The MIPS group [Munich Information Center for Protein Sequences of the German National Center for Environment and Health (GSF)] at the Max-PlanckInstitute for Biochemistry, Martinsried near Munich, Germany, is involved in a number of data collection activities, including a comprehensive database of ..."
Abstract
-
Cited by 52 (0 self)
- Add to MetaCart
its WWW server (http://www.mips.biochem.mpg.de ) MIPS provides access to a variety of generic databases, including a database of protein families as well as automatically generated data by the systematic application of sequence analysis algorithms. The yeast genome sequence and its related information
On Scheduling a Single Machine to Minimize a Piecewise Linear Objective Function : A Compact MIP Formulation
- in "Naval Research Logistics / Naval Research Logistics An International Journal
"... We study the scheduling situation in which a set of jobs subjected to release dates and deadlines are to be performed on a single machine. The objective is to minimize a piecewise linear objective function ∑ j Fj where Fj(Cj) corresponds to the cost of the completion of job j at time Cj. This class ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
is closely related to the well-known time-indexed MIP formulation but uses much less variables and constraints. Experiments on academic benchmarks as well as on real-life industrial problems show that our generic MIP formulation is e cient.
Generic separations
- JOURNAL OF COMPUTER AND SYSTEMS SCIENCES
, 1996
"... We show that MAEXP, the exponential time version of problems in complexity theory. It is still true that virtually the Merlin-Arthur class, does not have polynomial size cir- all of the theorems in computational complexity theory that cuits. This significantly improves the previous known result hav ..."
Abstract
- Add to MetaCart
theory that does not relativize. As a corollary to our viously always taken the form of collapses such as IP= separation result we also obtain that PEXP, the exponen- PSPACE [LFKN92, Sha92], MIP=NEXP [BFL91] and tial time version of PP is not in P=poly. PCP(O(1);O(logn))=NP [ALM+92]. In this paper we
Repairing mip infeasibility through local branching
- COMPUTERS AND OPERATIONS RESEARCH (2006). DOI 10.1016/J.COR.2006.08.004
, 2005
"... Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching have been proposed to address the problem of finding a feasible solution and improving it, respectively. In this paper w ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching have been proposed to address the problem of finding a feasible solution and improving it, respectively. In this paper
Local branching
- MATHEMATICAL PROGRAMMING
, 2002
"... The availability of effective exact or heuristic solution methods for general Mixed-Integer Programs (MIPs) is of paramount importance for practical ap-plications. In the present paper we investigate the use of a generic MIP solver as a black-box “tactical ” tool to explore effectively suitable solu ..."
Abstract
-
Cited by 91 (9 self)
- Add to MetaCart
The availability of effective exact or heuristic solution methods for general Mixed-Integer Programs (MIPs) is of paramount importance for practical ap-plications. In the present paper we investigate the use of a generic MIP solver as a black-box “tactical ” tool to explore effectively suitable
ONE SOLVER FOR ALL- A GENERIC ALLOCATION CONCEPT FOR PLANNING AND SHOP FLOOR CONTROL
"... This paper gives an overview of several optimization solutions for semiconductor problems using mixed integer programming (MIP). The single solutions presented in former papers are not key of the publication. We rather focus on the generic portion within each solution and the approach of building a ..."
Abstract
- Add to MetaCart
This paper gives an overview of several optimization solutions for semiconductor problems using mixed integer programming (MIP). The single solutions presented in former papers are not key of the publication. We rather focus on the generic portion within each solution and the approach of building a
Results 1 - 10
of
52
