Sciweavers

736 search results - page 95 / 148
» Algorithms for Ordinal Arithmetic
Sort
View
HICSS
1995
IEEE
109views Biometrics» more  HICSS 1995»
14 years 8 days ago
HINT: A new way to measure computer performance
The computing community has long faced the problem of scientifically comparing different computers and different algorithms. When architecture, method, precision, or storage capac...
John L. Gustafson, Quinn Snell
COCO
2006
Springer
88views Algorithms» more  COCO 2006»
13 years 10 months ago
Polynomial Identity Testing for Depth 3 Circuits
We study the identity testing problem for depth 3 arithmetic circuits ( circuit). We give the first deterministic polynomial time identity test for circuits with bounded top fanin...
Neeraj Kayal, Nitin Saxena
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
13 years 10 months ago
Certifying and repairing solutions to large LPs how good are LP-solvers?
State-of-the-art linear programming (LP) solvers give solutions without any warranty. Solutions are not guaranteed to be optimal or even close to optimal. Of course, it is general...
Marcel Dhiflaoui, Stefan Funke, Carsten Kwappik, K...
CPC
2000
93views more  CPC 2000»
13 years 8 months ago
Fast Unimodular Counting
This paper describes methods for counting the number of non-negative integer solutions of the system Ax = b when A is a non-negative totally unimodular matrix and b an integral ve...
John Mount
FOCM
2002
83views more  FOCM 2002»
13 years 8 months ago
A Rigorous ODE Solver and Smale's 14th Problem
We present an algorithm for computing rigorous solutions to a large class of ordinary differential equations. The main algorithm is based on a partitioning process and the use of i...
Warwick Tucker