Sciweavers

911 search results - page 135 / 183
» The New Promise of Analog Computation
Sort
View
IJFCS
2006
130views more  IJFCS 2006»
13 years 7 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
14 years 5 months ago
Non-commutative circuits and the sum-of-squares problem
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
Pavel Hrubes, Avi Wigderson and Amir Yehudayoff
BMCBI
2011
12 years 11 months ago
Clustering gene expression data with a penalized graph-based metric
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
Ariel E. Bayá, Pablo M. Granitto
CEC
2009
IEEE
14 years 13 days ago
Memetic algorithm with Local search chaining for large scale continuous optimization problems
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
Daniel Molina, Manuel Lozano, Francisco Herrera
MMM
2010
Springer
141views Multimedia» more  MMM 2010»
13 years 9 months ago
Slow Intelligence Systems
: Networks and distributed computing systems are becoming increasingly important and at the same time, more and more critical to the world of Information Technology. This rash spre...
Shi-Kuo Chang