Sciweavers

166 search results - page 25 / 34
» Complexity of Some Geometric and Topological Problems
Sort
View
PODC
2009
ACM
14 years 9 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
CIBCB
2005
IEEE
14 years 2 months ago
Feedback Memetic Algorithms for Modeling Gene Regulatory Networks
— In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of memetic algori...
Christian Spieth, Felix Streichert, Jochen Supper,...
GECCO
2003
Springer
153views Optimization» more  GECCO 2003»
14 years 1 months ago
SEPA: Structure Evolution and Parameter Adaptation in Feed-Forward Neural Networks
Abstract. In developing algorithms that dynamically changes the structure and weights of ANN (Artificial Neural Networks), there must be a proper balance between network complexit...
Paulito P. Palmes, Taichi Hayasaka, Shiro Usui
MVA
2002
132views Computer Vision» more  MVA 2002»
13 years 8 months ago
Constituting Feasible Folding Operation Using Incomplete Crease Information
This paper proposes a novel approach to constituting all the feasible ways of folding, based on crease infomation obtained from an image of illustrations of general origami drill ...
Hiroshi Shimanuki, Jien Kato, Toyohide Watanabe
ICALP
1998
Springer
14 years 25 days ago
Bridges for Concatenation Hierarchies
In the seventies, several classification schemes for the rational languages were proposed, based on the alternate use of certain operators (union, complementation, product and star...
Jean-Eric Pin