Sciweavers

9842 search results - page 349 / 1969
» Problem complexity
Sort
View
COCO
1998
Springer
123views Algorithms» more  COCO 1998»
15 years 11 months ago
Isolation, Matching, and Counting
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
Eric Allender, Klaus Reinhardt
ICDCS
2007
IEEE
16 years 1 months ago
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space
Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complex...
Borzoo Bonakdarpour, Sandeep S. Kulkarni
ICDAR
2009
IEEE
16 years 1 months ago
An RDF-Based Blackboard Architecture for Improving Table Analysis
Table analysis is a complex problem, involving searching solutions from a large search space. Studies show that finding the most credible answers to complex problems often requir...
Vanessa Long
SECURWARE
2008
IEEE
16 years 1 months ago
Polynomial Heuristic Algorithms for Inconsistency Characterization in Firewall Rule Sets
Firewalls provide the first line of defence of nearly all networked institutions today. However, Firewall ACLs could have inconsistencies, allowing traffic that should be denied o...
Sergio Pozo Hidalgo, Rafael Ceballos, Rafael M. Ga...
ACTA
1998
111views more  ACTA 1998»
15 years 6 months ago
Machine Scheduling with Availability Constraints
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
Eric Sanlaville, Günter Schmidt