Sciweavers

537 search results - page 49 / 108
» A Call to Regularity
Sort
View
BMCBI
2006
122views more  BMCBI 2006»
13 years 7 months ago
CoSMoS: Conserved Sequence Motif Search in the proteome
Background: With the ever-increasing number of gene sequences in the public databases, generating and analyzing multiple sequence alignments becomes increasingly time consuming. N...
Xiao I. Liu, Neeraj Korde, Ursula Jakob, Lars I. L...
CN
2007
102views more  CN 2007»
13 years 7 months ago
The "Global-ISP" paradigm
We present a new paradigm, called “Global ISP” (G-ISP). Its goal is to solve, or at least alleviate, problems of inter-domain routing, such as slow convergence, and lack of Qo...
Reuven Cohen, Amnon Shochot
IJMC
2006
84views more  IJMC 2006»
13 years 7 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
JMLR
2006
78views more  JMLR 2006»
13 years 7 months ago
Inductive Synthesis of Functional Programs: An Explanation Based Generalization Approach
We describe an approach to the inductive synthesis of recursive equations from input/outputexamples which is based on the classical two-step approach to induction of functional Li...
Emanuel Kitzelmann, Ute Schmid
RIA
2006
84views more  RIA 2006»
13 years 7 months ago
Learning Recursive Automata from Positive Examples
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
Isabelle Tellier