5624 search results - page 910 / 1125 » On Conditional Covering Problem |
183
click to vote
SAC
2006
ACM
16 years 12 days ago
2006
ACM
Dynamic languages typically allow programs to be written y high level of abstraction. But their dynamic nature makes it very hard to compile such languages, meaning that a price h...
164
Voted
SIGCOMM
2006
ACM
16 years 12 days ago
2006
ACM
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
179
click to vote
SIGECOM
2006
ACM
16 years 12 days ago
2006
ACM
We present and evaluate the design of Deep Maize, our entry in the 2005 Trading Agent Competition Supply Chain Management scenario. The central idea is to decompose the problem by...
173
Voted
SIGMETRICS
2006
ACM
16 years 12 days ago
2006
ACM
A new methodology to assess transient performance measures of tree-like processes is proposed by introducing the concept of tree-like processes with marked time epochs. As opposed...
156
Voted
SPAA
2006
ACM
16 years 12 days ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...