Sciweavers

4266 search results - page 408 / 854
» The container loading problem
Sort
View
LOGCOM
2006
90views more  LOGCOM 2006»
15 years 6 months ago
ATL Satisfiability is Indeed EXPTIME-complete
The Alternating-time Temporal Logic (ATL) of Alur, Henzinger, and Kupferman is being increasingly widely applied in the specification and verification of open distributed systems ...
Dirk Walther, Carsten Lutz, Frank Wolter, Michael ...
JAR
2000
123views more  JAR 2000»
15 years 6 months ago
Local Search Algorithms for SAT: An Empirical Evaluation
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
Holger H. Hoos, Thomas Stützle
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
15 years 6 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
CORR
1998
Springer
82views Education» more  CORR 1998»
15 years 6 months ago
Tractability of Theory Patching
In this paper we consider the problem of theory patching, in which we are given a domain theory, some of whose components are indicated to be possibly awed, and a set of labeled t...
Shlomo Argamon-Engelson, Moshe Koppel
ICFEM
2010
Springer
15 years 5 months ago
Verifying Heap-Manipulating Programs with Unknown Procedure Calls
Abstract. Verification of programs with invocations to unknown procedures is a practical problem, because in many scenarios not all codes of programs to be verified are available...
Shengchao Qin, Chenguang Luo, Guanhua He, Florin C...