Sciweavers

3837 search results - page 345 / 768
» Learning Approximate Consistencies
Sort
View
FSTTCS
2003
Springer
16 years 2 days ago
On the Covering Steiner Problem
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
Anupam Gupta, Aravind Srinivasan
HAIS
2009
Springer
15 years 11 months ago
Pareto-Based Multi-output Model Type Selection
In engineering design the use of approximation models (= surrogate models) has become standard practice for design space exploration, sensitivity analysis, visualization and optimi...
Dirk Gorissen, Ivo Couckuyt, Karel Crombecq, Tom D...
ARITH
1999
IEEE
15 years 11 months ago
High-Speed Inverse Square Roots
Inverse square roots are used in several digital signal processing, multimedia, and scientific computing applications. This paper presents a high-speed method for computing invers...
Michael J. Schulte, Kent E. Wires
INFOCOM
1997
IEEE
15 years 11 months ago
Server Selection Using Dynamic Path Characterization in Wide-Area Networks
Replication is a commonly proposed solution to problems of scale associated with distributed services. However, when a service is replicated, each client must be assigned a server...
Robert L. Carter, Mark Crovella
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
15 years 10 months ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma