Sciweavers

1110 search results - page 64 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
EVOW
1999
Springer
15 years 3 months ago
Approximate Equivalence Verification for Protocol Interface Implementation via Genetic Algorithms
This paper describes a new approximate approach for checking the correctness of the implementation of a protocol interface, comparing its lowlevel implementation with its high-leve...
Fulvio Corno, Matteo Sonza Reorda, Giovanni Squill...
JAIR
2007
141views more  JAIR 2007»
14 years 11 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
IJCAI
2003
15 years 18 days ago
Maximizing Flexibility: A Retraction Heuristic for Oversubscribed Scheduling Problems
In this paper we consider the solution of scheduling problems that are inherently over-subscribed. In such problems, there are always more tasks to execute within a given time fra...
Laurence A. Kramer, Stephen F. Smith
POPL
2009
ACM
15 years 12 months ago
Modular code generation from synchronous block diagrams: modularity vs. code size
We study modular, automatic code generation from hierarchical block diagrams with synchronous semantics. Such diagrams are the fundamental model behind widespread tools in the emb...
Roberto Lublinerman, Christian Szegedy, Stavros Tr...
IWPC
2007
IEEE
15 years 5 months ago
Designing your Next Empirical Study on Program Comprehension
The field of program comprehension is characterized by both the continuing development of new tools and techniques and the adaptation of existing techniques to address program co...
Massimiliano Di Penta, R. E. Kurt Stirewalt, Eilee...