Sciweavers

1523 search results - page 234 / 305
» The Computational Complexity of Linear Optics
Sort
View
STACS
2010
Springer
14 years 4 months ago
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
François Le Gall
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
14 years 4 months ago
Multiplicative approximations and the hypervolume indicator
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...
Tobias Friedrich, Christian Horoba, Frank Neumann
ICIC
2009
Springer
14 years 4 months ago
Function Sequence Genetic Programming
Genetic Programming(GP) can obtain a program structure to solve complex problem. This paper presents a new form of Genetic Programming, Function Sequence Genetic Programming (FSGP)...
Shixian Wang, Yuehui Chen, Peng Wu
ICTAC
2009
Springer
14 years 4 months ago
Input-Output Model Programs
Abstract. Model programs are used as high-level behavioral specifications typically representing abstract state machines. For modeling reactive systems, one uses input-output mode...
Margus Veanes, Nikolaj Bjørner
SMI
2008
IEEE
118views Image Analysis» more  SMI 2008»
14 years 4 months ago
A least-norm approach to flattenable mesh surface processing
Following the definition of developable surface in differential geometry, the flattenable mesh surface, a special type of piecewiselinear surface, inherits the good property of ...
Charlie C. L. Wang