Sciweavers

4565 search results - page 44 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
ICCV
2011
IEEE
12 years 9 months ago
Optimizing Polynomial Solvers for Minimal Geometry Problems
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
Oleg Naroditsky, Kostas Daniilidis
VLDB
1998
ACM
97views Database» more  VLDB 1998»
14 years 1 months ago
Design and Analysis of Parametric Query Optimization Algorithms
Query optimizers normally compile queries into one optimal plan by assuming complete knowledge of all cost parameters such asselectivity and resourceavailability. The execution of...
Sumit Ganguly
ASPDAC
2006
ACM
129views Hardware» more  ASPDAC 2006»
14 years 2 months ago
Yield-area optimizations of digital circuits using non-dominated sorting genetic algorithm (YOGA)
With shrinking technology, the timing variation of a digital circuit is becoming the most important factor while designing a functionally reliable circuit. Gate sizing has emerged...
Vineet Agarwal, Janet Meiling Wang
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
14 years 2 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
AAAI
2006
13 years 10 months ago
Optimal Scheduling of Contract Algorithms for Anytime Problems
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then compute a solution within the ...
Alejandro López-Ortiz, Spyros Angelopoulos,...