77 search results - page 10 / 16 » The Core Concept for 0 1 Integer Programming |
ASPLOS
2009
ACM
14 years 8 months ago
2009
ACM
Current shared memory multicore and multiprocessor systems are nondeterministic. Each time these systems execute a multithreaded application, even if supplied with the same input,...
COR
2008
13 years 8 months ago
2008
Introducing a new concept of (, )-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 1, nor more than 1, times...
ICCAD
1999
IEEE
14 years 3 days ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
CPM
2000
Springer
14 years 4 days ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
LOBJET
2006
13 years 7 months ago
2006
Many object-oriented software applications contain implicit business rules. Although there exist many approaches that advocate the separation of rules, the rules' connections ...