2899 search results - page 311 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
194
click to vote
WEBI
2005
Springer
16 years 1 days ago
2005
Springer
Schema matching is a complex process focusing on matching between concepts describing the data in heterogeneous data sources. There is a shift from manual schema matching, done by...
186
click to vote
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
170
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
For more than 35 years, the fastest known method for integer multiplication has been the Sch?onhage-Strassen algorithm running in time O(n log n log log n). Under certain restricti...
150
click to vote
LATA
2010
Springer
16 years 1 months ago
2010
Springer
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
171
click to vote
DATE
2007
IEEE
16 years 28 days ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...