Sciweavers

10988 search results - page 341 / 2198
» Algorithmic Folding Complexity
Sort
View
104
Voted
JETAI
2002
71views more  JETAI 2002»
15 years 4 months ago
Comparing performance of algorithms for generating concept lattices
Several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of wellknown algorithms are proposed. Algo...
Sergei O. Kuznetsov, Sergei A. Obiedkov
MP
1998
83views more  MP 1998»
15 years 4 months ago
A modified layered-step interior-point algorithm for linear programming
The layered-step interior-point algorithm was introduced by Vavasis and Ye. The algorithm accelerates the path following interior-point algorithm and its arithmetic complexity dep...
Nimrod Megiddo, Shinji Mizuno, Takashi Tsuchiya
VTC
2010
IEEE
150views Communications» more  VTC 2010»
15 years 3 months ago
Path Selection Algorithms for Multi-Hop VANETs
—In this paper, we introduce a collision model for vehicular cluster and we propose path selection algorithms for multi-hop VANETs. That is, we propose the intuitive algorithm na...
Chulhee Jang, Jae Hong Lee
VTC
2006
IEEE
115views Communications» more  VTC 2006»
15 years 10 months ago
Suboptimal Maximum Likelihood Detection Using Gradient-based Algorithm for MIMO Channels
Abstract— This paper proposes a suboptimal maximum likelihood detection (MLD) algorithm for multiple-input multipleoutput (MIMO) communications. The proposed algorithm regards tr...
Thet Htun Khine, Kazuhiko Fukawa, Hiroshi Suzuki
FOSSACS
2011
Springer
14 years 8 months ago
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
Naoki Kobayashi