Sciweavers

14518 search results - page 150 / 2904
» Two Problems for Sophistication
Sort
View
AUTOMATICA
2005
78views more  AUTOMATICA 2005»
13 years 10 months ago
Problems on time-varying port-controlled Hamiltonian systems: geometric structure and dissipative realization
To apply time-varying port-controlled Hamiltonian (PCH) systems to practical control designs, two basic problems should be dealt with: one is how to provide such time-varying syst...
Yuzhen Wang, Daizhan Cheng, Xiaoming Hu
CEC
2007
IEEE
14 years 4 months ago
A novel genetic algorithm for the layout optimization problem
— In this paper we present a new algorithm for the Layout Optimization Problem: this concerns the placement of circular, weighted objects inside a circular container, the two obj...
Yichun Xu, Renbin Xiao, Martyn Amos
ISLPED
2003
ACM
96views Hardware» more  ISLPED 2003»
14 years 3 months ago
Effective graph theoretic techniques for the generalized low power binding problem
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
Azadeh Davoodi, Ankur Srivastava
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
14 years 2 months ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand
APPML
2008
159views more  APPML 2008»
13 years 10 months ago
The rook problem on saw-toothed chessboards
A saw-toothed chessboard, or STC for short, is a kind of chessboard whose boundary forms two staircases from left down to right without any hole inside it. A rook at square (i, j)...
Hon-Chan Chen, Ting-Yem Ho