Sciweavers

14518 search results - page 190 / 2904
» Two Problems for Sophistication
Sort
View
84
Voted
TPDS
1998
71views more  TPDS 1998»
15 years 9 days ago
Parallel Algorithms for Relational Coarsest Partition Problems
—Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are 3-complete and hence it may not be possible to desig...
Sanguthevar Rajasekaran, Insup Lee
JCAM
2010
173views more  JCAM 2010»
14 years 7 months ago
A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method
The Sakurai-Sugiura projection method, which solves a generalized eigenvalue problem to find certain eigenvalues in a given domain, was reformulated by using the resolvent theory....
Tsutomu Ikegami, Tetsuya Sakurai, Umpei Nagashima
SAINT
2008
IEEE
15 years 7 months ago
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem
We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two diff...
Markus Leitner, Günther R. Raidl
94
Voted
CEC
2005
IEEE
15 years 6 months ago
An ant algorithm hyperheuristic for the project presentation scheduling problem
Abstract- Ant algorithms have generated significant research interest within the search/optimisation community in recent years. Hyperheuristic research is concerned with the devel...
Edmund K. Burke, Graham Kendall, Dario Landa Silva...
CIMCA
2005
IEEE
15 years 6 months ago
Ant Colony System for Optimizing Vehicle Routing Problem with Time Windows
Research on the optimization of Vehicle Routing Problem with Time Windows (VRPTW) is a significant investigation area of ant colony system (ACS). This paper proposes an enhanced AC...
Xuan Tan, Xuyao Luo, W. N. Chen, Jun Zhang