Results 1  10
of
94
9 A Quest for Refocussing Stem Cell Induction Strategies: How to Deal with Ethical Objections and Patenting Problems
"... tho ..."
Solving Large Quadratic Assignment Problems on Computational Grids
, 2000
"... The quadratic assignment problem (QAP) is among the hardest combinatorial optimization problems. Some instances of size n = 30 have remained unsolved for decades. The solution of these problems requires both improvements in mathematical programming algorithms and the utilization of powerful computat ..."
Abstract

Cited by 82 (7 self)
 Add to MetaCart
The quadratic assignment problem (QAP) is among the hardest combinatorial optimization problems. Some instances of size n = 30 have remained unsolved for decades. The solution of these problems requires both improvements in mathematical programming algorithms and the utilization of powerful
A Cost Model for Similarity Queries in Metric Spaces
, 1998
"... Wu consider tho problem of estimating CPU (distance computntlons) nnd I/O costs for processing range and knearest neighbors qucrics over metric spaces. Unlike the specific case of vector spaces, where information on data distribution has been exploited to derive cost models for predicting the per ..."
Abstract

Cited by 61 (12 self)
 Add to MetaCart
Wu consider tho problem of estimating CPU (distance computntlons) nnd I/O costs for processing range and knearest neighbors qucrics over metric spaces. Unlike the specific case of vector spaces, where information on data distribution has been exploited to derive cost models for predicting the per
ILLUSTRATION OF A TEST \lHICH COMPARES THO PARALLEL REGRESSION LINES WHEN THE VARIANCES ARE UNEQUAL.
, 1962
"... Contract No. AF 49(638)213 In a situation where two regression lines are known to be parallel, it may be desired to test the hypothesis that the two lines are identical without assuming thet the variances of the two sets of error terms are necessarily equal. This paper presents a relatively nontec ..."
Abstract
 Add to MetaCart
technical discussion of a test which can be used for this problem. The test statistic is analogous to the wellknown Wilcoxon statistic. The obtaining of the test statistic involves a large number of routine calculations, and (in general) a computer is needed for this. This paper is intended for the practitioner
What Should Be the Unique Role of Teaching or tho Unique Applications of Teaching in Departments of Speech Communication Located in Urban
, 1973
"... Urban environments are characterized by crowding, heterogeneous groups, disparities in opportUnity between inner city and suburbia, concentrated hostility, complexity in organizational communication factors, depersonalization, dependence on mass communication, and high interdependence requiring bala ..."
Abstract
 Add to MetaCart
applications of empathic and problemcentered patterns developed by writers such as Ginott; (2) enhancement of social action and implementation processes through emphasis on principles related to the areas of communication anxiety reduction, organizational communication, and action campaigns; and
Analyzing and modeling the maximum diversity problem by zeroone programming. Decision Sci
, 1993
"... The problem of maximizing diversity deals with selecting a set of elements from some larger collection such that the selected elements exhibit the greatest variety of characteristics. A new model is proposed in which the concept of diversity is quantifiable and measurable. A quadratic zeroone model ..."
Abstract

Cited by 28 (3 self)
 Add to MetaCart
one model is formulated for diversity maximization. Based upon the formulation, it is shown that the maximum diversity problem is NPhard. 'Tho equivalent linear integer programs are then presented that offer progressively greater computational efficiency. Another formulation is also introduced which
GUIDELINES FOR WASTE REDOCTION AND RECYCLING SOLVENTS
"... program was established to provide technical assistance ta businesses and industries to reduce the amount of hazardous waste that they generate. atad helps to control co8ts and protect the environment. The Reducing the amount of waste gcnerThe DEQ Hazardous Waste Reduction Program works with facili ..."
Abstract
 Add to MetaCart
with facilities of all sizes to coma up with solution8 to tho problems associated with the generation, storage, treatment, and disposal of hazardour waste. The program can provide technical information on wart. reduction and recycling methodr for your business, In addition, the program can provide on
Solving Large Quadratic Assignment Problems on Computational Grids
"... The quadratic assignment problem (QAP) is among the hardest combinatorial optimization problems. Some instances of sizeÂ£Â¥ Â¤ 30 have remained unsolved for decades. The solution of these problems requires both improvements in mathematical programming algorithms and the utilization of powerful compu ..."
Abstract
 Add to MetaCart
The quadratic assignment problem (QAP) is among the hardest combinatorial optimization problems. Some instances of sizeÂ£Â¥ Â¤ 30 have remained unsolved for decades. The solution of these problems requires both improvements in mathematical programming algorithms and the utilization of powerful
Timing Analysis in COSPAN
 In Hybrid Systems III
, 1996
"... . We describe how to model and verify realtime systems using the formal verification tool Cospan. The verifier supports automatatheoretic verification of coordinating processes with timing constraints. We discuss different heuristics, and our experiences with the tool for certain benchmark problems ..."
Abstract

Cited by 47 (7 self)
 Add to MetaCart
problems appearing in the verification literature. 1 Introduction Model checking is a method of automatically verifying concurrent systems in which a finitestate model of a system is compared with a correctness requirement. This method has been shown to be very effective in detecting errors in high
Approximation algorithms for Euler genus and related problems
 54TH IEEE SYMP. FOUNDATIONS OF COMPUTER SCIENCE
, 2013
"... The Euler genus of a graph is a fundamental and wellstudied parameter in graph theory and topology. Computing it has been shown to be NPhard by Thomassen [Tho89, Tho93], and it is known to be fixedparameter tractable. However, the approximability of the Euler genus is wide open. While the existen ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The Euler genus of a graph is a fundamental and wellstudied parameter in graph theory and topology. Computing it has been shown to be NPhard by Thomassen [Tho89, Tho93], and it is known to be fixedparameter tractable. However, the approximability of the Euler genus is wide open. While
Results 1  10
of
94