1083 search results - page 64 / 217 » On the Number of Optimal Base 2 Representations of Integers |
124
click to vote
COMBINATORICS
1999
15 years 5 months ago
1999
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
186
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
164
click to vote
CGO
2003
IEEE
15 years 11 months ago
2003
IEEE
Optimizing programs at run-time provides opportunities to apply aggressive optimizations to programs based on information that was not available at compile time. At run time, prog...
148
click to vote
GBRPR
2007
Springer
16 years 10 days ago
2007
Springer
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...
133
click to vote
VLDB
1990
ACM
15 years 10 months ago
1990
ACM
Even though the large body of knowledge of relational query optimization techniques can be utilized as a starting point for object-oriented query optimization the full exploitatio...