2340 search results - page 119 / 468 » Copying and Comparing: Problems and Solutions |
156
click to vote
TCAD
2002
15 years 6 months ago
2002
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
187
click to vote
IJCAI
2001
15 years 7 months ago
2001
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
180
click to vote
MP
2002
15 years 6 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
205
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
186
click to vote
HT
1987
ACM
15 years 9 months ago
1987
ACM
Hypertext is a technology well-suited to exploring different kinds of representational problems. It can be used first as an informal mechanism to describe the attributes of object...