Sciweavers

851 search results - page 92 / 171
» Inaccessibility in Decision Procedures
Sort
View
IJCAI
2003
13 years 10 months ago
Maximizing Flexibility: A Retraction Heuristic for Oversubscribed Scheduling Problems
In this paper we consider the solution of scheduling problems that are inherently over-subscribed. In such problems, there are always more tasks to execute within a given time fra...
Laurence A. Kramer, Stephen F. Smith
CORR
2010
Springer
54views Education» more  CORR 2010»
13 years 9 months ago
Development of a Cargo Screening Process Simulator: A First Approach
The efficiency of current cargo screening processes at sea and air ports is largely unknown as few benchmarks exists against which they could be measured. Some manufacturers provi...
Peer-Olaf Siebers, Galina Sherman, Uwe Aickelin
CORR
2010
Springer
165views Education» more  CORR 2010»
13 years 9 months ago
Detecting Ontological Conflicts in Protocols between Semantic Web Services
Abstract. The task of verifying the compatibility between interacting web services has traditionally been limited to checking the compatibility of the interaction protocol in terms...
Priyankar Ghosh, Pallab Dasgupta
AMAI
2005
Springer
13 years 9 months ago
Resolution cannot polynomially simulate compressed-BFS
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
DoRon B. Motter, Jarrod A. Roy, Igor L. Markov
CCE
2004
13 years 8 months ago
A decomposition method for synthesizing complex column configurations using tray-by-tray GDP models
This paper describes an optimization procedure for the synthesis of complex distillation configurations. A superstructure based on the Reversible Distillation Sequence Model (RDSM...
Mariana Barttfeld, Pío A. Aguirre, Ignacio ...