15485 search results - page 2611 / 3097 » Computing Optimal Subsets |
176
click to vote
WINE
2005
Springer
16 years 13 days ago
2005
Springer
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
188
click to vote
IUI
2004
ACM
16 years 12 days ago
2004
ACM
Analysis of sketched digital ink is often aided by the division of stroke points into perceptually-salient fragments based on geometric features. Fragmentation has many applicatio...
204
click to vote
STOC
2004
ACM
16 years 12 days ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
203
click to vote
FPGA
2004
ACM
16 years 11 days ago
2004
ACM
The cost functions used to evaluate logic synthesis transformations for FPGAs are far removed from the final speed and routability determined after placement, routing and timing a...
209
click to vote
GD
2004
Springer
16 years 11 days ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...