Sciweavers

240 search results - page 2 / 48
» The Tree Inclusion Problem: In Optimal Space and Faster
Sort
View
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
13 years 9 months ago
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
Pankaj K. Agarwal, Yonatan Bilu, Rachel Kolodny
DATE
2006
IEEE
102views Hardware» more  DATE 2006»
13 years 9 months ago
Faster exploration of high level design alternatives using UML for better partitions
Partitioning is a time consuming and computationally complex optimization problem in the codesign of hardware software systems. The stringent time-to-market requirements have resu...
Waseem Ahmed, Doug Myers
CORR
2006
Springer
109views Education» more  CORR 2006»
13 years 3 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer
GECCO
2005
Springer
112views Optimization» more  GECCO 2005»
13 years 9 months ago
Two improved differential evolution schemes for faster global search
Differential evolution (DE) is well known as a simple and efficient scheme for global optimization over continuous spaces. In this paper we present two new, improved variants of D...
Swagatam Das, Amit Konar, Uday Kumar Chakraborty
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
13 years 7 months ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...