Sciweavers

2083 search results - page 186 / 417
» Perception and Experience in Problem Solving
Sort
View
RECOMB
2001
Springer
16 years 6 months ago
Finding motifs using random projections
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
Jeremy Buhler, Martin Tompa
CADE
2007
Springer
16 years 6 months ago
MaLARea: a Metasystem for Automated Reasoning in Large Theories
MaLARea (a Machine Learner for Automated Reasoning) is a simple metasystem iteratively combining deductive Automated Reasoning tools (now the E and the SPASS ATP systems) with a m...
Josef Urban
ICANN
2005
Springer
15 years 11 months ago
A Neural Network Model for Inter-problem Adaptive Online Time Allocation
One aim of Meta-learning techniques is to minimize the time needed for problem solving, and the effort of parameter hand-tuning, by automating algorithm selection. The predictive m...
Matteo Gagliolo, Jürgen Schmidhuber
FPGA
2003
ACM
137views FPGA» more  FPGA 2003»
15 years 11 months ago
Customized regular channel design in FPGAs
FPGAs are one of the essential components in platform-based embedded systems. Such systems are customized and applied only to a limited set of applications. Also some applications...
Elaheh Bozorgzadeh, Majid Sarrafzadeh
RECOMB
1997
Springer
15 years 10 months ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...