Results 11  20
of
463,130
On computing rational GaussChebyshev quadrature formulas. 2004
 In preparation
"... Abstract. We provide an algorithm to compute the nodes and weights for GaussChebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary real poles outside [−1, 1]. Contrary to existing rational quadrature formulas, the computational effort is very low, even for ..."
Abstract

Cited by 24 (18 self)
 Add to MetaCart
Abstract. We provide an algorithm to compute the nodes and weights for GaussChebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary real poles outside [−1, 1]. Contrary to existing rational quadrature formulas, the computational effort is very low, even
Computing rational solutions of linear matrix inequalities
 ISSAC'13
, 2013
"... Consider a (D × D) symmetric matrix A whose entries are linear forms in Q[X1,..., Xk] with coefficients of bit size ≤ τ. We provide an algorithm which decides the existence of rational solutions to the linear matrix inequality A ≽ 0 and outputs such a rational solution if it exists. This problem is ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Consider a (D × D) symmetric matrix A whose entries are linear forms in Q[X1,..., Xk] with coefficients of bit size ≤ τ. We provide an algorithm which decides the existence of rational solutions to the linear matrix inequality A ≽ 0 and outputs such a rational solution if it exists. This problem
Computing Rational Radical Sums in Uniform TC 0
"... A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of deciding whether ∑ m i=1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of deciding whether ∑ m i=1
Fractionfree Method for Computing Rational Normal Forms of Polynomial Matrices
, 1997
"... this paper, we present a fractionfree algorithm for computing rational normal forms of matrices with univariate polynomial entries. In the traditional algorithm based on Danilevskii's method, its principal transformations are similar to Gaussian elimination. When they are carried out exactly b ..."
Abstract
 Add to MetaCart
this paper, we present a fractionfree algorithm for computing rational normal forms of matrices with univariate polynomial entries. In the traditional algorithm based on Danilevskii's method, its principal transformations are similar to Gaussian elimination. When they are carried out exactly
Valued constraint satisfaction problems: Hard and easy problems
 IJCAI’95: PROCEEDINGS INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
, 1995
"... In order to deal with overconstrained Constraint Satisfaction Problems, various extensions of the CSP framework have been considered by taking into account costs, uncertainties, preferences, priorities...Each extension uses a specific mathematical operator (+, max...) to aggregate constraint violat ..."
Abstract

Cited by 331 (42 self)
 Add to MetaCart
violations. In this paper, we consider a simple algebraic framework, related to Partial Constraint Satisfaction, which subsumes most of these proposals and use it to characterize existing proposals in terms of rationality and computational complexity. We exhibit simple relationships between these proposals
COMPUTING RATIONAL POINTS IN CONVEX SEMIALGEBRAIC SETS AND SOS DECOMPOSITIONS
"... Let P = {h1,..., hs} ⊂ Z[Y1,..., Yk], D ≥ deg(hi) for 1 ≤ i ≤ s, σ bounding the bit length of the coefficients of the hi’s, and Φ be a quantifierfree Pformula defining a convex semialgebraic set. We design an algorithm returning a rational point in S if and only if S ∩ Q ̸ = ∅. It requires σO(1 ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
Let P = {h1,..., hs} ⊂ Z[Y1,..., Yk], D ≥ deg(hi) for 1 ≤ i ≤ s, σ bounding the bit length of the coefficients of the hi’s, and Φ be a quantifierfree Pformula defining a convex semialgebraic set. We design an algorithm returning a rational point in S if and only if S ∩ Q ̸ = ∅. It requires σ
Computing Rational GaussChebyshev Quadrature Formulas with Complex Poles: the Algorithm.
"... We provide an algorithm to compute arbitrarily many nodes and weights for rational GaussChebyshev quadrature formulas integrating exactly in spaces of rational functions with complex poles outside [−1, 1]. Contrary to existing rational quadrature formulas, the computational effort is very low, ev ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
We provide an algorithm to compute arbitrarily many nodes and weights for rational GaussChebyshev quadrature formulas integrating exactly in spaces of rational functions with complex poles outside [−1, 1]. Contrary to existing rational quadrature formulas, the computational effort is very low
Computationally Rational Saccadic Control: An Explanation of Spillover Effects Based on Sampling from Noisy Perception and Memory
"... Eyemovements in reading exhibit frequency spillover effects: fixation durations on a word are affected by the frequency of the previous word. We explore the idea that this effect may be an emergent property of a computationally rational eyemovement strategy that is navigating a tradeoff between ..."
Abstract
 Add to MetaCart
Eyemovements in reading exhibit frequency spillover effects: fixation durations on a word are affected by the frequency of the previous word. We explore the idea that this effect may be an emergent property of a computationally rational eyemovement strategy that is navigating a tradeoff be
Distributed Rational Decision Making
, 1999
"... Introduction Automated negotiation systems with selfinterested agents are becoming increasingly important. One reason for this is the technology push of a growing standardized communication infrastructureInternet, WWW, NII, EDI, KQML, FIPA, Concordia, Voyager, Odyssey, Telescript, Java, etco ..."
Abstract

Cited by 191 (0 self)
 Add to MetaCart
over which separately designed agents belonging to different organizations can interact in an open environment in realtime and safely carry out transactions. The second reason is strong application pull for computer support for negotiation at the operative decision making level. For example, we
Results 11  20
of
463,130