Sciweavers

4539 search results - page 578 / 908
» Approaches to Compute Workflow Complexity
Sort
View
GD
2008
Springer
15 years 7 months ago
The Binary Stress Model for Graph Drawing
We introduce a new force-directed model for computing graph layout. The model bridges the two more popular force directed approaches – the stress and the electrical-spring models...
Yehuda Koren, Ali Civril
GECCO
2008
Springer
363views Optimization» more  GECCO 2008»
15 years 7 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
CACM
2010
104views more  CACM 2010»
15 years 6 months ago
Faster dimension reduction
Data represented geometrically in high-dimensional vector spaces can be found in many applications. Images and videos, are often represented by assigning a dimension for every pix...
Nir Ailon, Bernard Chazelle
MP
2006
87views more  MP 2006»
15 years 6 months ago
Convexity and decomposition of mean-risk stochastic programs
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
Shabbir Ahmed
TVCG
2008
138views more  TVCG 2008»
15 years 6 months ago
Real-Time Path Planning in Dynamic Virtual Environments Using Multiagent Navigation Graphs
We present a novel approach for efficient path planning and navigation of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multiagent Navigatio...
Avneesh Sud, Erik Andersen, Sean Curtis, Ming C. L...