3299 search results - page 554 / 660 » A general mathematics of names |
207
click to vote
CCR
2004
15 years 6 months ago
2004
Circuit networks are expensive to build, difficult to operate, fragile, and not easily scalable. Many network operators would like to carry circuit traffic as an overlay on top of...
213
click to vote
KAIS
2000
15 years 6 months ago
2000
Abstract. In this paper we present an index structure, called MetricMap, that takes a set of objects and a distance metric and then maps those objects to a k-dimensional space in s...
135
click to vote
MOC
2000
15 years 6 months ago
2000
Let {Sm} be an infinite sequence whose limit or antilimit S can be approximated very efficiently by applying a suitable extrapolation method E0 to {Sm}. Assume that the Sm and henc...
146
click to vote
MST
2000
15 years 6 months ago
2000
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
196
click to vote
INFORMS
1998
15 years 6 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...