Sciweavers

2109 search results - page 4 / 422
» Solving Necklace Constraint Problems
Sort
View
NFM
2011
335views Formal Methods» more  NFM 2011»
13 years 7 days ago
CORAL: Solving Complex Constraints for Symbolic PathFinder
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in pr...
Matheus Souza, Mateus Borges, Marcelo d'Amorim, Co...
IJCAI
1993
13 years 7 months ago
Diagnosing and Solving Over-Determined Constraint Satisfaction Problems
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
R. R. Bakker, F. Dikker, F. Tempelman, P. M. Wognu...
TCSV
2010
13 years 15 days ago
Solving Streaming Capacity Problems in P2P VoD Systems
Abstract--Peer-to-peer (P2P) video-on-demand (VoD) is a popular Internet service for a large number of concurrent users. Streaming capacity in a P2P VoD system is defined as the ma...
Yifeng He, Ling Guan
IEEEVAST
2010
13 years 19 days ago
Comparing different levels of interaction constraints for deriving visual problem isomorphs
Interaction and manual manipulation have been shown in the cognitive science literature to play a critical role in problem solving. Given different types of interactions or constr...
Wenwen Dou, Caroline Ziemkiewicz, Lane Harrison, D...
PPSN
1998
Springer
13 years 10 months ago
Solving Binary Constraint Satisfaction Problems Using Evolutionary Algorithms with an Adaptive Fitness Function
This paper presents a comparative study of Evolutionary Algorithms (EAs) for Constraint Satisfaction Problems (CSPs). We focus on EAs where fitness is based on penalization of cons...
A. E. Eiben, Jano I. van Hemert, Elena Marchiori, ...