Sciweavers

3913 search results - page 214 / 783
» complexity 2006
Sort
View
JOT
2006
121views more  JOT 2006»
15 years 4 months ago
Constructing persistent object-oriented models with standard C++
In this paper, it is suggested an approach and a design pattern for developing object-oriented models that need to be persistent, including the databases of moderate size, with us...
Alexander Kozynchenko
JCP
2006
99views more  JCP 2006»
15 years 4 months ago
On Maximum-Likelihood Detection for Non-coherent FH/BFSK in Multitone Jamming
We derive the optimum maximum-likelihood (ML) non-coherent detector for FH/BFSK systems in the environment of multitone jamming and additive white Gaussian noise with no aid of jam...
Yi-Chen Chen
JSW
2006
98views more  JSW 2006»
15 years 4 months ago
A Jxta Based Asynchronous Peer-to-Peer Implementation of Genetic Programming
Abstract-- Solving complex real-world problems using evolutionary computation is a CPU time-consuming task that requires a large amount of computational resources. Peerto-Peer (P2P...
Gianluigi Folino, Agostino Forestiero, Giandomenic...
156
Voted
JALC
2002
97views more  JALC 2002»
15 years 4 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
IJCGA
2010
99views more  IJCGA 2010»
15 years 3 months ago
Finding All Door Locations that Make a Room Searchable
—A room is a simple polygon with a prespecified point, called the door, on its boundary. Search may be conducted by two guards on the boundary who keep mutual visibility at all ...
Tsunehiko Kameda, John Z. Zhang