Sciweavers

2430 search results - page 162 / 486
» Computing Tutte Polynomials
Sort
View
SAGT
2009
Springer
131views Game Theory» more  SAGT 2009»
15 years 11 months ago
The Computational Complexity of Weak Saddles
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
Felix Brandt, Markus Brill, Felix A. Fischer, Jan ...
GBRPR
2007
Springer
15 years 11 months ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 11 months ago
A study on metamodeling techniques, ensembles, and multi-surrogates in evolutionary computation
Surrogate-Assisted Memetic Algorithm(SAMA) is a hybrid evolutionary algorithm, particularly a memetic algorithm that employs surrogate models in the optimization search. Since mos...
Dudy Lim, Yew-Soon Ong, Yaochu Jin, Bernhard Sendh...
PKC
2007
Springer
125views Cryptology» more  PKC 2007»
15 years 11 months ago
Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
Damg˚ard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...
Takashi Nishide, Kazuo Ohta
ICRA
2006
IEEE
141views Robotics» more  ICRA 2006»
15 years 10 months ago
Computing 3-legged Equilibrium Stances in Three-dimensional Gravitational Environments
— Quasistatic multi-legged locomotion consists of a sequence of equilibrium postures where the mechanism supports itself against gravity while moving free limbs to new positions....
Yizhar Or, Elon Rimon