Sciweavers

1632 search results - page 261 / 327
» On special numberings of hypergraphs
Sort
View
COLT
1993
Springer
15 years 10 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
CDC
2009
IEEE
155views Control Systems» more  CDC 2009»
15 years 10 months ago
Efficient and robust communication topologies for distributed decision making in networked systems
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...
John S. Baras, Pedram Hovareshti
CGO
2004
IEEE
15 years 10 months ago
A Compiler Scheme for Reusing Intermediate Computation Results
Recent research has shown that programs often exhibit value locality. Such locality occurs when a code segment, although executed repeatedly in the program, takes only a small num...
Yonghua Ding, Zhiyuan Li
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 10 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
SIGSOFT
1995
ACM
15 years 10 months ago
An Experiment to Assess the Cost-Benefits of Code Inspections in Large Scale Software Development
—We conducted a long-term experiment to compare the costs and benefits of several different software inspection methods. These methods were applied by professional developers to ...
Adam A. Porter, Harvey P. Siy, Carol A. Toman, Law...