Sciweavers

6 search results - page 1 / 2
» Search-based improvement of subsystem decompositions
Sort
View
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
13 years 10 months ago
Search-based improvement of subsystem decompositions
The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs t...
Olaf Seng, Markus Bauer, Matthias Biehl, Gert Pach...
ICPR
2006
IEEE
14 years 6 months ago
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
Hiroaki Sakoe, Seiichi Uchida, Wenjie Cai
CDC
2008
IEEE
112views Control Systems» more  CDC 2008»
13 years 11 months ago
Application of the proximal center decomposition method to distributed model predictive control
Abstract— In this paper we present a dual-based decomposition method, called here the proximal center method, to solve distributed model predictive control (MPC) problems for cou...
Ion Necoara, Dang Doan, Johan A. K. Suykens
ICSM
1999
IEEE
13 years 9 months ago
Bunch: A Clustering Tool for the Recovery and Maintenance of Software System Structures
Software systems are typically modified in order to extend or change their functionality, improve their performance, port them to different platforms, and so on. For developers, i...
Spiros Mancoridis, Brian S. Mitchell, Yih-Farn Che...