Sciweavers

9810 search results - page 181 / 1962
» Problems, Descriptions and Objects
Sort
View
FCT
2003
Springer
15 years 9 months ago
On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
Andrzej Szalas
IJCAI
2007
15 years 6 months ago
Handling Alternative Activities in Resource-Constrained Project Scheduling Problems
In the context of operative disruption management, decision support systems have to evaluate the typically manifold options of responding to disturbances: The temporal shift of ac...
Jürgen Kuster, Dietmar Jannach, Gerhard Fried...
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
15 years 4 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
ISESE
2002
IEEE
15 years 9 months ago
Replicating Software Engineering Experiments: Addressing the Tacit Knowledge Problem
Recently the awareness of the importance of replicating studies has been growing in the empirical software engineering community. The results of any one study cannot simply be ext...
Forrest Shull, Victor R. Basili, Jeffrey Carver, J...
148
Voted
ASPDAC
1998
ACM
119views Hardware» more  ASPDAC 1998»
15 years 8 months ago
Integer Programming Models for Optimization Problems in Test Generation
— Test Pattern Generation for combinational circuits entails the identification of primary input assignments for detecting each fault in a set of target faults. An extension to ...
João P. Marques Silva