Sciweavers

2050 search results - page 95 / 410
» constraints 2010
Sort
View
STTT
2010
92views more  STTT 2010»
13 years 4 months ago
Don't care in SMT: building flexible yet efficient abstraction/refinement solvers
ion/refinement solvers1 Andreas Bauer , Martin Leucker , Christian Schallhart , Michael Tautschnig Computer Sciences Laboratory, Australian National University Institut f
Andreas Bauer 0002, Martin Leucker, Christian Scha...
EOR
2006
97views more  EOR 2006»
13 years 10 months ago
A simulated annealing and hill-climbing algorithm for the traveling tournament problem
The Traveling Tournament Problem (TTP) [E. Easton, G. Nemhauser, M. Trick, The traveling tournament problem description and benchmarks, in: Proceedings of the 7th International Co...
Andrew Lim, Brian Rodrigues, X. Zhang
ENTCS
2002
77views more  ENTCS 2002»
13 years 10 months ago
Syntactic Type Soundness for HM(X)
The HM(X) framework is a constraint-based type framework with built-in letpolymorphism. This paper establishes purely syntactic type soundness for the framework, treating an exten...
Christian Skalka, François Pottier
TSE
2010
155views more  TSE 2010»
13 years 4 months ago
Incremental Test Generation for Software Product Lines
Recent advances in mechanical techniques for systematic testing have increased our ability to automatically find subtle bugs, and hence to deploy more dependable software. This pap...
Engin Uzuncaova, Sarfraz Khurshid, Don S. Batory
ICPR
2010
IEEE
14 years 5 months ago
Robust Matching in an Uncertain World
Finding point correspondences which are consistent with a geometric constraint is one of the cornerstones of many computer vision problems. This is a difficult task because of sp...
Frédéric Sur