Sciweavers

868 search results - page 36 / 174
» Finding Most Likely Solutions
Sort
View
EUROPAR
2006
Springer
13 years 11 months ago
Applicability of Load Balancing Strategies to Data-Parallel Embedded Runge-Kutta Integrators
Abstract. Embedded Runge-Kutta methods are among the most popular methods for the solution of non-stiff initial value problems of ordinary differential equations (ODEs). We investi...
Matthias Korch, Thomas Rauber
IPCO
1993
138views Optimization» more  IPCO 1993»
13 years 9 months ago
An efficient approximation algorithm for the survivable network design problem
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
Harold N. Gabow, Michel X. Goemans, David P. Willi...
INTEGRATION
2008
89views more  INTEGRATION 2008»
13 years 7 months ago
Exact ESCT minimization for functions of up to six input variables
In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...
ENTCS
2002
207views more  ENTCS 2002»
13 years 7 months ago
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
Tadao Takaoka
CEC
2003
IEEE
14 years 1 months ago
Comparison of sampling sizes for the co-evolution of cooperative agents
Abstract -_The evolution of a heterogeneousteam behavior can he a very demanding task. In order to promote the greatest level of specialization team members should be evolved in se...
Gary B. Parker, H. Joseph Blumenthal