Results 1  10
of
19,189
An Enumerative Algorithm for the Frequency Assignment Problem
 Discrete Applied Mathematics
, 2003
"... We present an algorithm to solve the Frequency Assignment Problem for mobile cellular systems and radio and television broadcasting. Frequencies must be assigned to transmitters in order to meet interference requirements and so that the overall signal/noise ratio is satisfactory. The basic scheme i ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
is an exact enumerative method, provided with ¯xing criteria to reduce the size of the instances. Larger instances are solved by applying the algorithm to suitable subinstances, eventually extending the solutions found. We were able to solve large real life instances arising in radio broadcasting, and mobile
An Enumerative Algorithm for TwoMachine Flow Shop Problems with Earliness and Tardiness Penalties
"... We consider a twomachine flow shop problem with a common due date where the objective is to minimize the sum of functions which penalize early as well as tardy completion of jobs. Since the problem is NPhard in the strong sense, we investigate some general properties of optimal schedules for t ..."
Abstract
 Add to MetaCart
for the problem, we develop lower and upper bounds, derive dominance criteria, and propose an enumerative algorithm for finding an optimal schedule. The performance of the proposed algorithm together with the influence of the individual components is thoroughly discussed.
AN ENUMERATIVE ALGORITHM FOR NONLINEAR MULTILEVEL INTEGER PROGRAMMING PROBLEM 1
, 2007
"... Abstract: In this paper a multilevel programming problem, that is, three level programming problem is considered. It involves three optimization problems where the constraint region of the first level problem is implicitly determined by two other optimization problems. The objective function of the ..."
Abstract
 Add to MetaCart
, an enumerative algorithm is proposed, which finds an optimum solution to the given problem. It is illustrated with the help of an example.
problems of type1: A taskoriented enumerative algorithm
"... Research on the singlemodel stochastic assembly line balancing ..."
An Efficient Boosting Algorithm for Combining Preferences
, 1999
"... The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new boosting ..."
Abstract

Cited by 707 (18 self)
 Add to MetaCart
The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new
A theory of timed automata
, 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract

Cited by 2651 (32 self)
 Add to MetaCart
and logic, and much progress has been made in developing verification algorithms, heuristics, and tools. This paper provides a survey of the theory of timed automata, and their role in specification and verification of realtime systems.
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 574 (50 self)
 Add to MetaCart
in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a calculus on computation trees over realnumbered time. Unfortunately
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via MEllipsoid Coverings
, 2010
"... We give an algorithm for solving the exact Shortest Vector Problem in ndimensional lattices, in any norm, in deterministic 2 O(n) time (and space), given poly(n)sized advice that depends only on the norm. In many norms of interest, including all ℓp norms, the advice is efficiently and deterministi ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We give an algorithm for solving the exact Shortest Vector Problem in ndimensional lattices, in any norm, in deterministic 2 O(n) time (and space), given poly(n)sized advice that depends only on the norm. In many norms of interest, including all ℓp norms, the advice is efficiently
Graphical models, exponential families, and variational inference
, 2008
"... The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building largescale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fiel ..."
Abstract

Cited by 800 (26 self)
 Add to MetaCart
likelihoods, marginal probabilities and most probable configurations. We describe how a wide varietyof algorithms — among them sumproduct, cluster variational methods, expectationpropagation, mean field methods, maxproduct and linear programming relaxation, as well as conic programming relaxations — can
Results 1  10
of
19,189