Sciweavers

4797 search results - page 272 / 960
» The complexity of partition tasks
Sort
View
IJCAI
1989
15 years 7 months ago
Functional Representation of Designs and Redesign Problem Solving
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de­ sign task takes as input the specifications of the desired functions of a device...
Ashok K. Goel, B. Chandrasekaran
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
16 years 4 days ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
DAC
1998
ACM
16 years 7 months ago
Rate Derivation and Its Applications to Reactive, Real-Time Embedded Systems
An embedded system the system continuously interacts with its environment under strict timing constraints, called the external constraints, and it is important to know how these e...
Ali Dasdan, Dinesh Ramanathan, Rajesh K. Gupta
IWPC
2007
IEEE
16 years 26 days ago
A Comparative Study of Three Program Exploration Tools
Programmers need tools to help explore large software systems when performing software evolution tasks. A variety of tools have been created to improve the effectiveness of such e...
Brian de Alwis, Gail C. Murphy, Martin P. Robillar...
ECLIPSE
2006
ACM
16 years 17 days ago
Guidance through active concerns
Producing usable documentation has always been a tedious task, and even communicating important knowledge about a system among collaborators is difficult. This paper describes an ...
Barthélémy Dagenais, Harold Ossher