Sciweavers

240 search results - page 13 / 48
» Improved Adomian decomposition method
Sort
View
IJCAI
2003
13 years 8 months ago
On a generalization of triangulated graphs for domains decomposition of CSPs
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...
Assef Chmeiss, Philippe Jégou, Lamia Keddar
ICML
2007
IEEE
14 years 8 months ago
Large-scale RLSC learning without agony
The advances in kernel-based learning necessitate the study on solving a large-scale non-sparse positive definite linear system. To provide a deterministic approach, recent resear...
Wenye Li, Kin-Hong Lee, Kwong-Sak Leung
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
13 years 2 months ago
A distributed Newton method for Network Utility Maximization
Most existing work uses dual decomposition and subgradient methods to solve Network Utility Maximization (NUM) problems in a distributed manner, which suffer from slow rate of con...
Ermin Wei, Asuman E. Ozdaglar, Ali Jadbabaie
CPAIOR
2011
Springer
12 years 11 months ago
Almost Square Packing
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...
Helmut Simonis, Barry O'Sullivan
ICCS
2005
Springer
14 years 1 months ago
Data-Parallel Method for Georeferencing of MODIS Level 1B Data Using Grid Computing
Georeference is a basic function of remote sensing data processing. Geo-corrected remote sensing data is an important source data for Geographic Information Systems (GIS) and other...
Yincui Hu, Yong Xue, Jiakui Tang, Shaobo Zhong, Gu...