Sciweavers

736 search results - page 80 / 148
» Algorithms for Ordinal Arithmetic
Sort
View
ESA
2009
Springer
106views Algorithms» more  ESA 2009»
14 years 2 months ago
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Abstract. We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollob´as, and Sor...
Markus Bläser, Christian Hoffmann
CEC
2008
IEEE
14 years 2 months ago
Differential evolution for discrete optimization: An experimental study on Combinatorial Auction problems
: Differential evolutionary (DE) mutates solution vectors by the weighted difference of other vectors using arithmetic operations. As these operations cannot be directly extended t...
Jingqiao Zhang, Viswanath Avasarala, Arthur C. San...
ICIP
2005
IEEE
14 years 9 months ago
Predictive compression of dynamic 3D meshes
An efficient algorithm for compression of dynamic time-consistent 3D meshes is presented. Such a sequence of meshes contains a large degree of temporal statistical dependencies tha...
Aljoscha Smolic, Karsten Müller, Matthias Kau...
DAC
2008
ACM
14 years 8 months ago
Symbolic noise analysis approach to computational hardware optimization
This paper addresses the problem of computational error modeling and analysis. Choosing different word-lengths for each functional unit in hardware implementations of numerical al...
Arash Ahmadi, Mark Zwolinski
STOC
2005
ACM
144views Algorithms» more  STOC 2005»
14 years 8 months ago
Pseudorandom generators for low degree polynomials
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
Andrej Bogdanov