Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
57
Optimal Birth Control of Population Dynamics. II. Problems with Free Final Time, Phase Constraints, and Mini-Max Costs*
, 1988
"... We study optimal birth control of population systems of McKendrick type which is a distributed parameter system involving first order partial differential equations with nonlocal bilinear boundary control. New results on problems with free final time, phase constraints, and mini-max costs are presen ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
We study optimal birth control of population systems of McKendrick type which is a distributed parameter system involving first order partial differential equations with nonlocal bilinear boundary control. New results on problems with free final time, phase constraints, and mini-max costs
MiniMaxSat: a new weighted Max-SAT solver
- In International Conference on Theory and Applications of Satisfiability Testing
, 2007
"... Abstract. In this paper we introduce MINIMAXSAT, a new Max-SAT solver that incorporates the best SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction as in SAT), soft clauses (clauses whose falsification is penalized by a cost as in Max-SAT) as well as pseudo-boo ..."
Abstract
-
Cited by 37 (1 self)
- Add to MetaCart
Abstract. In this paper we introduce MINIMAXSAT, a new Max-SAT solver that incorporates the best SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction as in SAT), soft clauses (clauses whose falsification is penalized by a cost as in Max-SAT) as well as pseudo
Best Cost-Benefit Clinical Data Next to Investigate at Each Diagnostic Step
"... In 2008, we devised a computer program capable of diagnosing diseases in actual patients, as opposed to previous existing programs only usable as training or educational tools for internal medicine. Essentially every computer diagnostic program, provided with patient’s clinical data (symptoms, physi ..."
Abstract
- Add to MetaCart
-benefit clinical data next to investigate in the patient, to reach a successful end of the diagnostic quest with the smallest overall cost and greatest efficiency. Here again, our mini-max procedure is most useful, coupled with other novel devises, to minimize
On Communication Cost of Distributed Statistical Estimation and Dimensionality
"... We explore the connection between dimensionality and communication cost in distributed learning problems. Specifically we study the problem of estimating the mean ~ ✓ of an unknown d dimensional gaussian distribution in the distributed setting. In this problem, the samples from the unknown distribut ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
, in the interactive and simultaneous settings respectively. To complement, we also demonstrate an interactive protocol achieving the mini-max squared loss with O(md) bits of communication, which improves upon the simple simultaneous protocol by a logarithmic factor. Given the strong lower bounds in the general
Register allocation and binding for low power
- In Proceedings of the Design Automation Conference
, 1995
"... This paper describes a technique for calculating the switch-ing activity of a set of registers shared by dierent data values. Based on the assumption that the joint pdf (prob-ability density function) of the primary input random vari-ables is known or that a suciently large number of input vectors h ..."
Abstract
-
Cited by 68 (0 self)
- Add to MetaCart
has been given, the register assignment problem for minimum power consumption is formulated as a minimum cost clique covering of an appropriately dened compati-bility graph (which is shown to be transitively orientable). The problem is then solved optimally (in polynomial time) using a max-cost
ow
Computation Cost Saving of Robust Optimal Design by Cumulative Function Approximation
- Proceedings of the Third China-Japan-Korea Joint Symposium on Optimization of Structural and Mechanical Systems (CJK-OSM3
"... This paper proposes a new scheme for saving the computation cost of robust optimal design by using cumulative function approximation. Robust optimal design requires much more computation cost than nominal optimal design, because evaluation of each tentative solution requires iteration of system anal ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
fidelity of approximation through gradual, adaptive and cumulative addition of sample points. In this paper, the outline of the scheme is discussed, the procedures of mini-max type robust optimal design and Voronoi diagram based cumulative function approximation are reviewed, and their hybridization
Cost-efficient processing of min/max queries over distributed sensors with uncertainty
, 2004
"... The rapid development in micro-sensors and wireless networks has made large-scale sensor networks possible. However, the wide de-ployment of such systems is still hindered by their limited energy which quickly runs out in case of massive communication. In this paper, we study the cost-efficient proc ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
-efficient processing of aggregate queries that are generally communication-intensive. In particular, we fo-cus on MIN/MAX queries that require both identity and value in the answer. We study how to provide an error bound to such answers, and how to design an “optimal ” sensor-contact policy that mini
Structural relaxations by variable renaming and their compilation for solving MinCostSAT
- J. Symbolic Logic
, 2007
"... Abstract. Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit relaxations are seldom used. In this work, we consider the use of explicit relaxations for solving MinCostSAT, th ..."
Abstract
-
Cited by 17 (4 self)
- Add to MetaCart
% of the problems, Lazy, the runner up, 55%, and MinCostChaff, a recent MinCostSAT solver, 26%. The relation between the proposed relaxation method and existing structural solution methods such as cutset decomposition and derivatives such as mini-buckets is also discussed. 1
An Improved Algorithm for the Bilateral Assignment Problem
"... Abstract We are concerned with a variation of the assignment problem, where the assignment costs differ between assigners and assignees. We formulate this as a min-max optimization problem, present a surrogate relaxation approach to derive lower and upper bounds quickly, and show that the pegging te ..."
Abstract
- Add to MetaCart
conventional methods. Keywords bilateral assignment problem; mini-max optimization; pegging test 1
Efficient Algorithms and Design for Interpolation Filters in Digital Receiver
, 2014
"... Abstract: Based on polynomial functions this paper introduces a generalized design method for interpolation filters. The polynomial-based interpolation filters can be implemented efficiently by using a modified Farrow structure with an arbitrary frequency response, the filters allow many pass-bands ..."
Abstract
- Add to MetaCart
coefficients in frequency domain are got by minimizing the maxima (MiniMax) of the weighted mean squared error function. The degree of polynomials and the length of interpolation filter can be selected arbitrarily. Numerical examples verified the proposed design method not only can reduce the hardware cost
Results 1 - 10
of
57
