2976 search results - page 255 / 596 » On the bounded integer programming |
135
Voted
RSA
2011
15 years 13 hour ago
2011
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
124
click to vote
SIAMDM
2010
14 years 11 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
149
Voted
APLAS
2005
ACM
15 years 10 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
144
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
As defined by Aumann in 1959, a strong equilibrium is a Nash equilibrium that is resilient to deviations by coalitions. We give tight bounds on the strong price of anarchy for loa...
179
click to vote
SIGSOFT
2007
ACM
16 years 5 months ago
2007
ACM
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...