Sciweavers

1920 search results - page 114 / 384
» The Complexity of the A B C Problem
Sort
View
JSC
2011
99views more  JSC 2011»
14 years 9 months ago
Sparse polynomial division using a heap
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
Michael B. Monagan, Roman Pearce
FCCM
2009
IEEE
165views VLSI» more  FCCM 2009»
16 years 1 months ago
Accelerating Quadrature Methods for Option Valuation
This paper presents an architecture for FPGA acceleration of quadrature methods used for pricing complex options, such as discrete barrier, Bermudan, and American options. The arc...
Anson H. T. Tse, David B. Thomas, Wayne Luk
IJCNN
2007
IEEE
16 years 23 days ago
Integrating a Flexible Representation Machinery in a Model of Human Concept Learning
— High-order human cognition involves processing of abstract and categorically represented knowledge. Traditionally, it has been considered that there is a single innate internal...
Toshihiko Matsuka, Yasuaki Sakamoto
SPDP
1993
IEEE
15 years 10 months ago
Extended Distributed Genetic Algorithm for Channel Routing
In this paper, we propose a new parallel genetic alge rithm (GA), called Extended Distributed Genetic Algorithm (EDGA), for channel routing problem. The EDGA combines the advantag...
B. B. Prahlada Rao, R. C. Hansdah
4OR
2006
118views more  4OR 2006»
15 years 6 months ago
Dealing with inconsistent judgments in multiple criteria sorting models
Sorting models consist in assigning alternatives evaluated on several criteria to ordered categories. To implement such models it is necessary to set the values of the preference p...
Vincent Mousseau, Luis C. Dias, José Rui Fi...