74 search results - page 10 / 15 » Exploiting equalities in polynomial programming |
JGO
2010
13 years 2 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
CADE
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
In many multiagent settings, situations arise in which agents must collectively make decisions while not every agent is supposed to have an equal amount of influence in the outcom...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
A method that automatically estimates the metrical structure of a piece of music is presented. The approach is based on the generation of a beat similarity matrix, which provides ...
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
The next major advancement in television is expected to be stereoscopic three-dimensional television (3D-TV). A successful roll-out of 3D-TV will require a backwardcompatible tran...