Sciweavers

12289 search results - page 509 / 2458
» computing 2006
Sort
View
JAL
2002
86views more  JAL 2002»
15 years 6 months ago
Exploiting structure in quantified formulas
We study the computational problem "find the value of the quantified formula obtained by quantifying the variables in a sum of terms." The "sum" can be based o...
Richard Edwin Stearns, Harry B. Hunt III
INFORMATICALT
1998
105views more  INFORMATICALT 1998»
15 years 6 months ago
Parallel Implementation of a Generalized Conjugate Gradient Algorithm
This paper presents a parallel version of a Generalized Conjugate Gradient algorithm proposed by Liu and Story in which the search direction considers the effect of the inexact lin...
Jonas Koko, Aziz Moukrim
JC
2000
78views more  JC 2000»
15 years 6 months ago
Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation
Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm ...
Fabrice Rouillier, Marie-Françoise Roy, Moh...
IPL
2010
115views more  IPL 2010»
15 years 5 months ago
Hardness and approximation of minimum distortion embeddings
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
Pinar Heggernes, Daniel Meister
INFORMATICALT
2006
117views more  INFORMATICALT 2006»
15 years 6 months ago
Job Sequencing with Exponential Functions of Processing Times
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
Adam Janiak, Mikhail Y. Kovalyov