Sciweavers

2412 search results - page 92 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
DNA
2006
Springer
126views Bioinformatics» more  DNA 2006»
15 years 6 months ago
On the Complexity of Graph Self-assembly in Accretive Systems
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
Stanislav Angelov, Sanjeev Khanna, Mirkó Vi...
ECAI
2006
Springer
15 years 6 months ago
AI and Music: Toward a Taxonomy of Problem Classes
The application of Artificial Intelligence technology to the field of music has always been fascinating, from the first attempts in automating human problem solving behavior till t...
Oliver Kramer, Benno Stein, Jürgen Wall
KBSE
1998
IEEE
15 years 7 months ago
Automated Software Test Data Generation for Complex Programs
We report on GADGET, a new software test generation system that uses combinatorial optimization to obtain condition/decision coverage of C/C++ programs. The GADGET system is fully...
Christoph C. Michael, Gary McGraw
SACMAT
2005
ACM
15 years 8 months ago
Purpose based access control of complex data for privacy protection
As privacy becomes a major concern for both consumers and enterprises, many research efforts have been devoted to the development of privacy protecting technology. We recently pr...
Ji-Won Byun, Elisa Bertino, Ninghui Li
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 8 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun