14649 search results - page 2740 / 2930 » Principles of problem solving |
186
click to vote
CCO
2001
Springer
15 years 11 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
180
click to vote
WABI
2001
Springer
15 years 10 months ago
2001
Springer
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
126
click to vote
ICCAD
2000
IEEE
15 years 10 months ago
2000
IEEE
To implement high-performance global interconnect without impacting the performance of existing blocks, the use of buffer blocks is increasingly popular in structured-custom and b...
165
click to vote
ASPLOS
2000
ACM
15 years 10 months ago
2000
ACM
Parallel, multithreaded C and C++ programs such as web servers, database managers, news servers, and scientific applications are becoming increasingly prevalent. For these applic...
156
click to vote
ASIACRYPT
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. In 1985 Fell and Diffie proposed constructing trapdoor functions with multivariate equations [11]. They used several sequentially solved stages. Another idea of building ...