Sciweavers

686 search results - page 124 / 138
» Foundations for Bidirectional Programming
Sort
View
97
Voted
IWPEC
2009
Springer
15 years 4 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
CANDC
2009
ACM
15 years 4 months ago
Exploring illuminative systems in informal networks of adults
Whenever we feel those ‘higher’ and hard to define sensations like synchronicity, love, wholeness, and appreciation is this a pattern or illuminative system that is part of a ...
Amy K. Scatliff
CODES
2008
IEEE
15 years 4 months ago
Static analysis of processor stall cycle aggregation
Processor Idle Cycle Aggregation (PICA) is a promising approach for low power execution of processors, in which small memory stalls are aggregated to create a large one, and the p...
Jongeun Lee, Aviral Shrivastava
TPHOL
2007
IEEE
15 years 3 months ago
Verifying Nonlinear Real Formulas Via Sums of Squares
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
John Harrison
CCS
2007
ACM
15 years 3 months ago
Polyglot: automatic extraction of protocol message format using dynamic binary analysis
Protocol reverse engineering, the process of extracting the application-level protocol used by an implementation, without access to the protocol specification, is important for m...
Juan Caballero, Heng Yin, Zhenkai Liang, Dawn Xiao...