Sciweavers

2899 search results - page 376 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 10 months ago
Selecting for evolvable representations
Evolutionary algorithms tend to produce solutions that are not evolvable: Although current fitness may be high, further search is impeded as the effects of mutation and crossover ...
Joseph Reisinger, Risto Miikkulainen
BIOCOMP
2009
15 years 7 months ago
Improving Remote Homology Detection Using Sequence Properties and Position Specific Scoring Matrices
Current biological sequence comparison tools frequently fail to recognize matches between homologs when sequence similarity is below the twilight zone of less than 25% sequence id...
Gina Cooper, Michael L. Raymer
JAIR
2008
107views more  JAIR 2008»
15 years 6 months ago
Planning with Durative Actions in Stochastic Domains
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
Mausam, Daniel S. Weld
TCAD
2008
119views more  TCAD 2008»
15 years 6 months ago
Full-Chip Routing Considering Double-Via Insertion
As the technology node advances into the nanometer era, via-open defects are one of the dominant failures due to the copper cladding process. To improve via yield and reliability, ...
Huang-Yu Chen, Mei-Fang Chiang, Yao-Wen Chang, Lum...
CORR
2007
Springer
135views Education» more  CORR 2007»
15 years 6 months ago
Detailed Network Measurements Using Sparse Graph Counters: The Theory
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
Yi Lu, Andrea Montanari, Balaji Prabhakar