Sciweavers

8025 search results - page 442 / 1605
» Combinators Introduction: An Algorithm
Sort
View
ENGL
2007
82views more  ENGL 2007»
15 years 7 months ago
Reduct Generation in Information Systems
— In any information system, the reducts are useful in classifying data. Janusz Starzyk developed an algorithm for computing reducts using strong equivalence and the law of expan...
G. Ganesan, D. Latha, C. Raghavendra Rao
SIGCSE
2008
ACM
295views Education» more  SIGCSE 2008»
15 years 7 months ago
A specimen MPI application: N-Queens in parallel
: The generalized problem of placing n queens on an n-by-n board provides an "embarrassingly parallel" problem for parallel solution. This paper expands on the discussion...
Timothy J. Rolfe
ANOR
2002
100views more  ANOR 2002»
15 years 7 months ago
A Limited-Memory Multipoint Symmetric Secant Method for Bound Constrained Optimization
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...
Oleg P. Burdakov, José Mario Martíne...
COMBINATORICS
2002
102views more  COMBINATORICS 2002»
15 years 7 months ago
Computation in Coxeter Groups-I. Multiplication
An efficient and purely combinatorial algorithm for calculating products in arbitrary Coxeter groups is presented, which combines ideas of Fokko du Cloux and myself. Proofs are lar...
Bill Casselman
EOR
2002
67views more  EOR 2002»
15 years 7 months ago
Solving the multiple competitive facilities location problem
In this paper we propose five heuristic procedures for the solution of the multiple competitive facilities location problem. A franchise of several facilities is to be located in ...
Tammy Drezner, Zvi Drezner, Said Salhi