Sciweavers

920 search results - page 33 / 184
» Generating Satisfiable Problem Instances
Sort
View
JUCS
2006
97views more  JUCS 2006»
13 years 10 months ago
An Interval Constraint Branching Scheme for Lattice Domains
This paper presents a parameterized schema for interval constraint branching that (with suitable instantiations of the parameters) can solve interval constraint satisfaction probl...
Antonio J. Fernández, Patricia M. Hill
AAAI
1998
13 years 11 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
ISCIS
2003
Springer
14 years 3 months ago
Test Case Generation According to the Binary Search Strategy
One of the important tasks during software testing is the generation of test cases. Unfortunately, existing approaches to test case generation often have problems limiting their us...
Sami Beydeda, Volker Gruhn
WIRI
2005
IEEE
14 years 3 months ago
Mapping generation for XML data sources: a general framework
The inter-operability of multiple autonomous and heterogeneous data sources is an important issue in many applications such as mediation systems, datawarehouses, or web-based syst...
Zoubida Kedad, Xiaohui Xue
CAD
2007
Springer
13 years 10 months ago
Generating strictly non-self-overlapping structured quadrilateral grids
In this paper, we present a BPM (Bézier Patch Mapping) algorithm which generates a strictly non-self-overlapping structured quadrilateral grid in a given four-sided planar region...
Hongwei Lin, Kai Tang, Ajay Joneja, Hujun Bao