Sciweavers

3875 search results - page 353 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
ICTAI
2009
IEEE
15 years 4 months ago
TiMDPpoly: An Improved Method for Solving Time-Dependent MDPs
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
Emmanuel Rachelson, Patrick Fabiani, Fréd&e...
GLOBECOM
2007
IEEE
15 years 10 months ago
Efficient Self Protection Algorithms for Static Wireless Sensor Networks
Wireless sensor networks have been widely used in many surveillance applications. Due to the importance of sensor nodes in such applications, certain level of protection needs to b...
Yu Wang 0003, Xiang-Yang Li, Qian Zhang
EVOW
2010
Springer
16 years 1 months ago
WiMAX Network Planning Using Adaptive-Population-Size Genetic Algorithm
Abstract. IEEE 802.16, also known as WiMAX, is a new wireless access technology for currently increasing demand of wireless high-speed broadband service. Efficient and effective d...
Ting Hu, Yuanzhu Peter Chen, Wolfgang Banzhaf
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
16 years 7 days ago
PolyEDA: Combining Estimation of Distribution Algorithms and Linear Inequality Constraints
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
Jörn Grahl, Franz Rothlauf
ISPD
1997
ACM
186views Hardware» more  ISPD 1997»
15 years 11 months ago
EWA: exact wiring-sizing algorithm
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
Rony Kay, Gennady Bucheuv, Lawrence T. Pileggi