Sciweavers

INFORMATICALT
2010
101views more  INFORMATICALT 2010»
13 years 2 months ago
An Improved Differential Evolution Scheme for the Solution of Large-Scale Unit Commitment Problems
This paper presents an improved differential evolution (IDE) method for the solution of large-scale unit commitment (UC) problems. The objective of the proposed scheme is to determ...
Chen-Sung Chang
ICML
2010
IEEE
13 years 2 months ago
Multiple Non-Redundant Spectral Clustering Views
Many clustering algorithms only find one clustering solution. However, data can often be grouped and interpreted in many different ways. This is particularly true in the high-dim...
Donglin Niu, Jennifer G. Dy, Michael I. Jordan
WICOMM
2008
258views more  WICOMM 2008»
13 years 3 months ago
Introducing reliability and load balancing in mobile IPv6-based networks
With the recent advances in portable devices and wireless networks, a new paradigm of computing has emerged which is known as mobile computing. In general mobile computing can be ...
Jahanzeb Faizan, Hesham El-Rewini, Mohamed Khalil
FAC
2008
123views more  FAC 2008»
13 years 3 months ago
Interface synthesis and protocol conversion
Given deterministic interfaces P and Q, we investigate the problem of synthesising an interface R such that P composed with R refines Q. We show that a solution exists iff P and Q ...
Purandar Bhaduri, S. Ramesh
TON
2002
82views more  TON 2002»
13 years 4 months ago
Lexicographically optimal balanced networks
Abstract
Leonidas Georgiadis, Panos Georgatsos, Kostas Flor...
TEC
2002
117views more  TEC 2002»
13 years 4 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna
TCAD
2002
93views more  TCAD 2002»
13 years 4 months ago
Hierarchical buffered routing tree generation
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
Amir H. Salek, Jinan Lou, Massoud Pedram
TSMC
1998
92views more  TSMC 1998»
13 years 4 months ago
Solving the orientation-duality problem for a circular feature in motion
Circular features have been commonly used in numerous computer vision application areas for 3-D pose estimation. However, the estimation of such a feature’s pose from 2-D image ...
D. He, Beno Benhabib
RE
2002
Springer
13 years 4 months ago
Relating Software Requirements and Architectures Using Problem Frames
Problem frames provide a means of analyzing and decomposing problems. They emphasise the world outside of the computer, helping the developer to focus on the problem domain, inste...
Jon G. Hall, Michael Jackson, Robin C. Laney, Bash...
MOC
1998
94views more  MOC 1998»
13 years 4 months ago
Numerical calculation of the multiplicity of a solution to algebraic equations
A method to calculate numerically the multiplicity of a solution to a system of algebraic equations is presented. The method is an application of Zeuthen’s rule which gives the m...
Hidetsune Kobayashi, Hideo Suzuki, Yoshihiko Sakai