Sciweavers

1213 search results - page 57 / 243
» Approximation in quantale-enriched categories
Sort
View
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
14 years 11 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
14 years 11 months ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Thibaut Lust
GECCO
2008
Springer
363views Optimization» more  GECCO 2008»
14 years 11 months ago
Towards high speed multiobjective evolutionary optimizers
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder
SIGCOMM
2010
ACM
14 years 10 months ago
Shipping to streaming: is this shift green?
Streaming movies over the Internet has become increasingly popular in recent years as an alternative to mailing DVDs to a customer. In this paper we investigate the environmental-...
Anand Seetharam, Manikandan Somasundaram, Donald F...
TOG
2002
129views more  TOG 2002»
14 years 9 months ago
Homomorphic factorization of BRDF-based lighting computation
Several techniques have been developed to approximate Bidirectional Reflectance Distribution Functions (BRDF) with acceptable quality and performance for realtime applications. Th...
Lutz Latta, Andreas Kolb