Sciweavers

13376 search results - page 446 / 2676
» Problem Solving with
Sort
View
LOPSTR
2004
Springer
15 years 10 months ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski
155
Voted
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
15 years 6 months ago
A fractional model of the border gateway protocol (BGP)
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
164
Voted
ISMVL
2006
IEEE
99views Hardware» more  ISMVL 2006»
15 years 11 months ago
Signal Processing Algorithms and Multiple-Valued Logic Design Methods
Multiple-valued logic can be viewed as an alternative approach to solving many problems in transmission, storage, and processing of large and even increasing amounts of informatio...
Jaakko Astola, Radomir S. Stankovic
125
Voted
GBRPR
2007
Springer
15 years 11 months ago
Approximating TSP Solution by MST Based Graph Pyramid
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
Yll Haxhimusa, Walter G. Kropatsch, Zygmunt Pizlo,...
152
Voted
AAIM
2007
Springer
106views Algorithms» more  AAIM 2007»
15 years 9 months ago
A New Efficient Algorithm for Computing the Longest Common Subsequence
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
M. Sohel Rahman, Costas S. Iliopoulos