Sciweavers

1984 search results - page 80 / 397
» The colourful feasibility problem
Sort
View
VL
2006
IEEE
106views Visual Languages» more  VL 2006»
16 years 23 days ago
A Linguistic Analysis of How People Describe Software Problems
There is little understanding of how people describe software problems, but a variety of tools solicit, manage, and analyze these descriptions in order to streamline software deve...
Andrew J. Ko, Brad A. Myers, Duen Horng Chau
SOFSEM
2004
Springer
16 years 3 days ago
Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
George Boukeas, Constantinos Halatsis, Vassilis Zi...
AAAI
2008
15 years 9 months ago
Hybrid Constraint Tightening for Solving Hybrid Scheduling Problems
Hybrid Scheduling Problems (HSPs) contain both temporal and finite-domain variables, as well as constraints between them. A hybrid constraint over temporal and finite-domain varia...
James C. Boerkoel Jr., Edmund H. Durfee
CEC
2010
IEEE
15 years 7 months ago
A penalty-based genetic algorithm for the composite SaaS placement problem in the Cloud
— Cloud computing is a latest new computing paradigm where applications, data and IT services are provided over the Internet. Cloud computing has become a main medium for Softwar...
Zeratul Izzah Mohd Yusoh, Maolin Tang
COMPUTING
2006
126views more  COMPUTING 2006»
15 years 6 months ago
Algebraic Multigrid Based on Computational Molecules, 1: Scalar Elliptic Problems
We consider the problem of splitting a symmetric positive definite (SPD) stiffness matrix A arising from finite element discretization into the sum of edge matrices thereby assumi...
J. K. Kraus, Josef Schicho