Sciweavers

5995 search results - page 373 / 1199
» Algorithmic Game Theory
Sort
View
SCL
2008
82views more  SCL 2008»
15 years 6 months ago
An efficient algorithm for positive realizations
We observe that successive applications of known results from the theory of positive systems lead to an efficient general algorithm for positive realizations of transfer functions...
Wojciech Czaja, Philippe Jaming, Máté...
IPL
2010
109views more  IPL 2010»
15 years 1 months ago
A new parameter for a broadcast algorithm with locally bounded Byzantine faults
This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a c...
Akira Ichimura, Maiko Shigeno
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 10 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
16 years 7 months ago
Fast quantum algorithms for computing the unit group and class group of a number field
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...
Sean Hallgren
ISSAC
1989
Springer
77views Mathematics» more  ISSAC 1989»
15 years 11 months ago
A Parallel Implementation of the Cylindrical Algebraic Decomposition Algorithm
In this paper, we describe a parallelization scheme for Collins’ cylindrical algebraic decomposition algorithm for quantifier elimination in the theory of real closed fields. ...
B. David Saunders, Hong R. Lee, S. Kamal Abdali