## Search

Now showing items 1-10 of 27

#### Comparison of surface-modeling techniques

(IEEE, 1997-07)

Solution techniques based on surface integral equations are widely used in computational electromagnetics. The accurate surface models increase the accuracy solutions by using exact and flat-triangulation models for a ...

#### Solution of radiation problems using the fast multipole method

(IEEE, 1997-07)

Electromagnetic radiation problems involving electrically large radiators and reflectors are solved using the fast multipole method (FMM). The FMM enables the solution of large problems with existing computational resources ...

#### Fast noniterative steepest descent path algorithm for planar and quasi-planar patch geometries

(IEEE, 1998)

The fast noniterative steepest descent path (SDP) algorithm for planar and quasi-planar patch geometries are discussed. The comparison of scattered fields as computed by the method of moments (MOM) and fast direct algorithm ...

#### V. Lifschitz, ed., formalizing common sense: papers by John McCarthy

(Elsevier BV, 1995)

A review is presented of Lifschitz's collection of seventeen papers written by McCarthy on the subject of common sense. The book opens with a fine overview of McCarthy's research in artificial intelligence (AI). Lifschitz ...

#### Binary integer formulation for mixed-model assembly line balancing problem

(Pergamon Press, 1998-04-01)

The assembly line balancing problem has been a focus of interest to the academicians of production/operations
management for the last 40 years. Although there are numerous studies published
on the various aspects of the ...

#### Towards finding global representations of the efficient set in multiple objective mathematical programming

(John Wiley & Sons, 1997)

We propose and justify the proposition that finding truly global representations of the efficient sets of multiple objective mathematical programs is a worthy goal. We summarize the essential elements of a general global ...

#### A goal programming approach to mixed-model assembly line balancing problem

(Elsevier, 1997)

In this paper, a binary goal programming model for the mixed-model assembly line balancing (ALB) problem is developed. The model is based on the concepts developed by Patterson and Albracht [1] and the model of Deckro and ...

#### A new lower bounding scheme for the total weighted tardiness problem

(1998)

We propose a new dominance rule that provides a sufficient condition for local optimality for the 1∥Σw1Ti problem. We prove that if any sequence violates the proposed dominance rule, then switching the violating jobs either ...

#### Integration of reasoning systems in architectural modeling activities

(Elsevier Science, 1998)

In the first phase of a design process, the designer understands the problem and assimilates it to a conceptual framework that is already known to him. Due to the nature of design problems, the reasoning methods and ...

#### A saturated linear dynamical network for approximating maximum clique

(Institute of Electrical and Electronics Engineers, 1999-06)

We use a saturated linear gradient dynamical network for finding an approximate solution to the maximum clique problem. We show that for almost all initial conditions, any solution of the network defined on a closed hypercube ...