Sciweavers

14518 search results - page 209 / 2904
» Two Problems for Sophistication
Sort
View
APN
2006
Springer
15 years 4 months ago
The Synthesis Problem of Netcharts
A netchart is basically a Petri net whose places are located at some process and whose transitions are labeled by message sequence charts (MSCs). Two recent papers showed independe...
Nicolas Baudru, Rémi Morin
GECCO
2006
Springer
166views Optimization» more  GECCO 2006»
15 years 4 months ago
Solving identification problem for asynchronous finite state machines using genetic algorithms
A Genetic Algorithm, embedded in a simulation-based method, is applied to the identification of Asynchronous Finite State Machines. Two different coding schemes and their associat...
Xiaojun Geng
103
Voted
IJCGA
2006
85views more  IJCGA 2006»
15 years 21 days ago
Some Lower Bounds on Geometric Separability Problems
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitc...
86
Voted
JSAT
2006
94views more  JSAT 2006»
15 years 20 days ago
A Note on the Use of Independent Sets for the k-SAT Problem
An independent set of variables is one in which no two variables occur in the same clause in a given k-SAT instance. Recently, independent sets have obtained more attention. Due t...
Konstantin Kutzkov
83
Voted
NA
2008
203views more  NA 2008»
15 years 20 days ago
Block Krylov-Schur method for large symmetric eigenvalue problems
Stewart's Krylov-Schur algorithm offers two advantages over Sorensen's implicitly restarted Arnoldi (IRA) algorithm. The first is ease of deflation of converged Ritz vect...
Yunkai Zhou, Yousef Saad