Sciweavers

4860 search results - page 419 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
171
Voted
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
15 years 10 months ago
A multimodal particle swarm optimizer based on fitness Euclidean-distance ratio
One of the most critical issues that remains to be fully addressed in existing multimodal evolutionary algorithms is the difficulty in pre-specifying parameters used for estimatin...
Xiaodong Li
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
15 years 9 months ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard
IPPS
1997
IEEE
15 years 8 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
PODC
2011
ACM
14 years 6 months ago
Locally checkable proofs
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
Mika Göös, Jukka Suomela

Publication
334views
16 years 24 days ago
Rollout Sampling Approximate Policy Iteration
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schem...
Christos Dimitrakakis, Michail G. Lagoudakis