Sciweavers

1291 search results - page 38 / 259
» Computing the multiplicity structure in solving polynomial s...
Sort
View
SIAMSC
2008
127views more  SIAMSC 2008»
13 years 7 months ago
Fast (Structured) Newton Computations
Abstract. Many vector-valued functions, representing expensive computations, are also structured computations. In this case the calculation of the Newton step can be greatly accele...
Thomas F. Coleman, Wei Xu
ICCD
2001
IEEE
121views Hardware» more  ICCD 2001»
14 years 4 months ago
Determining Schedules for Reducing Power Consumption Using Multiple Supply Voltages
Dynamic power is the main source of power consumption in CMOS circuits. It depends on the square of the supply voltage. It may significantly be reduced by scaling down the supply ...
Noureddine Chabini, El Mostapha Aboulhamid, Yvon S...
JACM
2000
119views more  JACM 2000»
13 years 7 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
AUTOMATICA
2008
126views more  AUTOMATICA 2008»
13 years 7 months ago
Local stability analysis using simulations and sum-of-squares programming
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
Ufuk Topcu, Andrew K. Packard, Peter Seiler
ATAL
2006
Springer
13 years 11 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara