| ²é¿´: 2294 | »Ø¸´: 10 | ||
| ¡¾ÐüÉͽð±Ò¡¿»Ø´ð±¾ÌûÎÊÌ⣬×÷Õßyuanye2010½«ÔùËÍÄú 10 ¸ö½ð±Ò | ||
yuanye2010½ð³æ (СÓÐÃûÆø)
|
[ÇóÖú]
SCIÉó¸åÒâ¼û ÒÑÓÐ3È˲ÎÓë
|
|
|
Reviewer 2 This paper proposes a distributed algorithm for the economic dispatch problem (EDP). It mainly studies the stochastic gradient-push method with asynchronous step-size and noisy gradient to deal with the finite delays in time-varying directed communication network of EDP. The author shows nice mathematical skills in presenting the results. However, the reviewer has to raise some questions about the model and algorithm in this study: 1. Why not to include ramp-up and ramp-down limit constraint for units in the EDP model? Is the proposed algorithm applicable for an EDP model with time coupling constraints? 2. The author should indicate the difference or improvement of the proposed algorithm in this study compared with reference [29]. 3. In introduction, the author mentioned ¡®This work adopts asynchronous step-size, which provides a more flexible range for step-size.¡¯ However, the advantage of asynchronous step-size is well displayed in Section 5. 4. Numerical results in Section 5 should be simplified or reorganized. The author can just take one test system to analyze the effectiveness of the proposed algorithm in detail (for instance, 4-bus system). Moreover, comparison results between different cases are recommended to present in a table format for a better display. ¸÷λʦÐÖʦ½ã£ºÂé·³ÎÊÏÂÉó¸åÈË2µÄÕâ¸öÒâ¼ûÊÇ»ý¼«µÄ»¹ÊÇÏû¼«µÄ£¿Ð»Ð» 3. In introduction, the author mentioned ¡®This work adopts asynchronous step-size, which provides a more flexible range for step-size.¡¯ However, the advantage of asynchronous step-size is well displayed in Section 5. |
» ²ÂÄãϲ»¶
2026É격×Ô¼ö Áù¼¶440µç´ß»¯·½Ïò
ÒѾÓÐ3È˻ظ´
»¶Ó211±¾¿ÆÍ¬Ñ§£¬¹ýAÇø¹ú¼ÒÏߣ¬AÇø·ÇƫԶһ±¾£¬½»²æÑ§¿Æ¿ÎÌâ×é
ÒѾÓÐ24È˻ظ´
н®´óѧµØÖÊÓë¿óÒµ¹¤³ÌѧԺÕÐÉú
ÒѾÓÐ10È˻ظ´
Õе÷¼Á
ÒѾÓÐ11È˻ظ´
0856²ÄÁÏÓ뻯¹¤Çóµ÷¼Á£¡
ÒѾÓÐ11È˻ظ´
²ÄÁÏÓ뻯¹¤304Çóµ÷¼Á
ÒѾÓÐ10È˻ظ´
AÇøÒ»±¾½»²æ¿ÎÌâ×飬µÍ·Öµ÷¼Á£¬ÕÐÊÕ»úеµç×ÓÐÅϢͨÐŵȽ»²æ·½Ïò
ÒѾÓÐ31È˻ظ´
Öпƴó²ÄÁÏ299Çóµ÷¼Á
ÒѾÓÐ7È˻ظ´
301Çóµ÷¼Á
ÒѾÓÐ3È˻ظ´
²ÄÁÏ¿¼ÑÐ339Çóµ÷¼Á
ÒѾÓÐ3È˻ظ´
zxm_232004
гæ (ÖøÃûдÊÖ)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 1412.2
- É¢½ð: 1966
- ºì»¨: 31
- Ìû×Ó: 2102
- ÔÚÏß: 706Сʱ
- ³æºÅ: 4172288
- ×¢²á: 2015-10-25
- רҵ: Ë®ÎÄ¡¢Ë®×ÊÔ´
2Â¥2019-04-13 20:16:13
С9°®Ñ§Ï°
гæ (ÕýʽдÊÖ)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 1174.4
- É¢½ð: 981
- ºì»¨: 5
- Ìû×Ó: 694
- ÔÚÏß: 148.4Сʱ
- ³æºÅ: 2914790
- ×¢²á: 2014-01-05
- ÐÔ±ð: MM
- רҵ: Ó¦ÓÃÆøÏóѧ
|
¶ÔÄã½øÐÐÁ˿϶¨£¬ÉÔ΢Ìá³öÁËһЩÒâ¼û£¬Õⶼûʲô¹ØÏµ£¬ºÃºÃ¸Ä£¬¿Ï¶¨ÄܼÓà ·¢×ÔСľ³æAndroid¿Í»§¶Ë |
3Â¥2019-04-13 21:00:16
leisurelyy
Òø³æ (ÕýʽдÊÖ)
- Ó¦Öú: 1 (Ó×¶ùÔ°)
- ½ð±Ò: 1109
- É¢½ð: 530
- Ìû×Ó: 409
- ÔÚÏß: 210.1Сʱ
- ³æºÅ: 3326875
- ×¢²á: 2014-07-17
- ÐÔ±ð: GG
- רҵ: µØÀíѧ
4Â¥2019-04-13 22:25:32
|
×£¸£ ·¢×ÔСľ³æIOS¿Í»§¶Ë |
5Â¥2019-04-13 22:44:21
bobvan
ÖÁ×ðľ³æ (ÎÄ̳¾«Ó¢)
- SEPI: 1
- Ó¦Öú: 4791 (¸±½ÌÊÚ)
- ½ð±Ò: 32470.7
- É¢½ð: 20785
- ºì»¨: 351
- Ìû×Ó: 11187
- ÔÚÏß: 1516.7Сʱ
- ³æºÅ: 2171443
- ×¢²á: 2012-12-07
- רҵ: ´ß»¯»¯Ñ§
6Â¥2019-04-14 01:18:49
pehou
гæ (³õÈëÎÄ̳)
- Ó¦Öú: 1 (Ó×¶ùÔ°)
- ½ð±Ò: 84.3
- Ìû×Ó: 21
- ÔÚÏß: 1.6Сʱ
- ³æºÅ: 14817514
- ×¢²á: 2019-04-07
- ÐÔ±ð: GG
- רҵ: µçÁ¦ÏµÍ³
7Â¥2019-04-15 19:38:47
lw200814
Ìú³æ (ÕýʽдÊÖ)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 1335.8
- É¢½ð: 295
- ºì»¨: 4
- ɳ·¢: 3
- Ìû×Ó: 718
- ÔÚÏß: 18.3Сʱ
- ³æºÅ: 7336526
- ×¢²á: 2017-10-20
- רҵ: µçÁ¦ÏµÍ³
8Â¥2019-05-08 14:07:49
yuanye2010
½ð³æ (СÓÐÃûÆø)
- Ó¦Öú: 1 (Ó×¶ùÔ°)
- ½ð±Ò: 1120.3
- É¢½ð: 10
- ºì»¨: 1
- Ìû×Ó: 167
- ÔÚÏß: 157.9Сʱ
- ³æºÅ: 2548427
- ×¢²á: 2013-07-16
- ÐÔ±ð: GG
- רҵ: µçÁ¦ÏµÍ³
9Â¥2019-05-21 12:53:23
lw200814
Ìú³æ (ÕýʽдÊÖ)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 1335.8
- É¢½ð: 295
- ºì»¨: 4
- ɳ·¢: 3
- Ìû×Ó: 718
- ÔÚÏß: 18.3Сʱ
- ³æºÅ: 7336526
- ×¢²á: 2017-10-20
- רҵ: µçÁ¦ÏµÍ³
10Â¥2019-06-01 16:04:11













»Ø¸´´ËÂ¥
10