Sciweavers

2027 search results - page 11 / 406
» Approximating power indices
Sort
View
GECCO
2007
Springer
186views Optimization» more  GECCO 2007»
15 years 5 months ago
ICSPEA: evolutionary five-axis milling path optimisation
ICSPEA is a novel multi-objective evolutionary algorithm which integrates aspects from the powerful variation operators of the Covariance Matrix Adaptation Evolution Strategy (CMA...
Jörn Mehnen, Rajkumar Roy, Petra Kersting, To...
ADHOCNOW
2004
Springer
15 years 5 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
ADCM
2010
62views more  ADCM 2010»
14 years 12 months ago
Two condensed macro-elements with full approximation power
A variant of the classical C1 Powell-Sabin-12 macro-element is defined that has the same approximation power, but has fewer degrees of freedom and only requires vertex data. The sa...
Peter Alfeld, Larry L. Schumaker, Tatyana Sorokina
QUESTA
2010
62views more  QUESTA 2010»
14 years 10 months ago
Power series approximations for two-class generalized processor sharing systems
: We develop power series approximations for a discrete-time queueing system with two parallel queues and one processor. If both queues are non-empty, a customer of queue 1 is serv...
Joris Walraevens, J. S. H. van Leeuwaarden, Onno J...
ADHOCNOW
2008
Springer
15 years 6 months ago
Approximating Minimum-Power k-Connectivity
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
Zeev Nutov