Sciweavers

1197 search results - page 15 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
RC
2002
100views more  RC 2002»
13 years 7 months ago
Efficient Interval Linear Equality Solving in Constraint Logic Programming
Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving systems of linear constrai...
Chong-Kan Chiu, Jimmy Ho-Man Lee
HICSS
1994
IEEE
149views Biometrics» more  HICSS 1994»
14 years 3 days ago
Stochastic Problem Solving by Local Computation Based on Self-Organization Paradigm
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
Yasusi Kanada, Masao Hirokawa
EOR
2007
77views more  EOR 2007»
13 years 8 months ago
Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach
In this paper, we introduce an adaptive evolutionary approach to solve the short-term electrical generation scheduling problem (STEGS). The STEGS is a hard constraint satisfaction...
Jorge Maturana, María-Cristina Riff
SMA
2003
ACM
14 years 1 months ago
Geometric constraint solving via C-tree decomposition
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrai...
Xiao-Shan Gao, Gui-Fang Zhang
VMCAI
2007
Springer
14 years 2 months ago
Constraint Solving for Interpolation
Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of ‘good...
Andrey Rybalchenko, Viorica Sofronie-Stokkermans