Sciweavers

861 search results - page 28 / 173
» Faster integer multiplication
Sort
View
JSC
2011
99views more  JSC 2011»
12 years 12 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
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
14 years 2 months ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
GECCO
2003
Springer
103views Optimization» more  GECCO 2003»
14 years 2 months ago
Are Multiple Runs of Genetic Algorithms Better than One?
Abstract. There are conflicting reports over whether multiple independent runs of genetic algorithms (GAs) with small populations can reach solutions of higher quality or can fin...
Erick Cantú-Paz, David E. Goldberg
OZCHI
2006
ACM
14 years 2 months ago
LookPoint: an evaluation of eye input for hands-free switching of input devices between multiple computers
We present LookPoint, a system that uses eye input for switching input between multiple computing devices. LookPoint uses an eye tracker to detect which screen the user is looking...
Connor Dickie, Jamie Hart, Roel Vertegaal, Alex Ei...
JSW
2007
126views more  JSW 2007»
13 years 9 months ago
Efficient Evaluation of Multiple-Output Boolean Functions in Embedded Software or Firmware
— The paper addresses software and firmware implementation of multiple-output Boolean functions based on cascades of Look-Up Tables (LUTs). A LUT cascade is described as a means ...
Vaclav Dvorak