Sciweavers

1197 search results - page 155 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
PG
2003
IEEE
14 years 1 months ago
Bounding Recursive Procedural Models Using Convex Optimization
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
Orion Sky Lawlor, John C. Hart
CP
2006
Springer
13 years 12 months ago
The Modelling Language Zinc
We describe the Zinc modelling language. Zinc provides set constraints, user defined types, constrained types, and polymorphic predicates and functions. The last allows Zinc to be ...
Maria J. García de la Banda, Kim Marriott, ...
ISTA
2004
13 years 9 months ago
A Data Transformation Method Based on Schema Mapping
: Schema mapping is an important approach to solve the problem of data integration. This paper introduces a research prototype called SDE, which is a system for managing and facili...
You Li, Dongbo Liu, Weiming Zhang
ICST
2010
IEEE
13 years 6 months ago
Satisfying Test Preconditions through Guided Object Selection
—A random testing strategy can be effective at finding faults, but may leave some routines entirely untested if it never gets to call them on objects satisfying their preconditi...
Yi Wei, Serge Gebhardt, Bertrand Meyer, Manuel Ori...
FSTTCS
2010
Springer
13 years 6 months ago
Global Model Checking of Ordered Multi-Pushdown Systems
In this paper, we address the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations s...
Mohamed Faouzi Atig