Sciweavers

2976 search results - page 229 / 596
» On the bounded integer programming
Sort
View
ASE
2004
148views more  ASE 2004»
15 years 6 months ago
TestEra: Specification-Based Testing of Java Programs Using SAT
TestEra is a framework for automated specification-based testing of Java programs. TestEra requires as input a Java method (in sourcecode or bytecode), a formal specification of th...
Sarfraz Khurshid, Darko Marinov
CGO
2010
IEEE
16 years 1 months ago
Towards program optimization through automated analysis of numerical precision
Reducing the arithmetic precision of a computation has real performance implications, including increased speed, decreased power consumption, and a smaller memory footprint. For s...
Michael D. Linderman, Matthew Ho, David L. Dill, T...
CPAIOR
2006
Springer
15 years 10 months ago
The Power of Semidefinite Programming Relaxations for MAX-SAT
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
Carla P. Gomes, Willem Jan van Hoeve, Lucian Leahu
ICRA
2008
IEEE
129views Robotics» more  ICRA 2008»
16 years 22 days ago
Pareto optimal multi-robot coordination with acceleration constraints
— We consider a collection of robots sharing a common environment, each robot constrained to move on a roadmap in its configuration space. To program optimal collision-free moti...
Jae Bum Jung, Robert Christ
NFM
2011
242views Formal Methods» more  NFM 2011»
15 years 1 months ago
Model Checking Using SMT and Theory of Lists
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
Aleksandar Milicevic, Hillel Kugler