Sciweavers

1920 search results - page 66 / 384
» The Complexity of the A B C Problem
Sort
View
164
Voted
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
15 years 9 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
179
Voted
KBSE
1998
IEEE
15 years 10 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
186
Voted
BTW
1997
Springer
112views Database» more  BTW 1997»
15 years 10 months ago
Database Application Programming with Versioned Complex Objects
Database systems as basis for CAD frameworks have to provide data management as well as transaction management facilities meeting the requirements of design applications. One of t...
Udo Nink, Norbert Ritter
AAAI
1996
15 years 7 months ago
Knowledge-Based Navigation of Complex Information Spaces
While the explosion of on-line information has brought new opportunities for nding and using electronic data, it has also brought to the forefront the problem of isolating useful ...
Robin D. Burke, Kristian J. Hammond, Benjamin C. Y...
GLOBECOM
2007
IEEE
16 years 12 days ago
Low PAPR STBCs from Complex Partial-Orthogonal Designs (CPODs)
— Space-time codes from complex orthogonal designs (CODs) with no zero entries offer low Peak to Average power ratio (PAPR) and avoid the problem of turning off antennas. But COD...
Gopu V. R. Muni Kumar, B. Sundar Rajan