5832 search results - page 186 / 1167 » Software complexity and maintainability |
129
click to vote
CHI
2008
ACM
16 years 4 months ago
2008
ACM
Coarse-grained approaches to customization allow the user to enable or disable groups of features at once, rather than individual features. While this may reduce the complexity of...
121
click to vote
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions...
172
click to vote
FSTTCS
2005
Springer
15 years 9 months ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
117
click to vote
ISSAC
2004
Springer
15 years 9 months ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
129
click to vote
SUTC
2010
IEEE
15 years 8 months ago
2010
IEEE
—To maximize the communication throughput for wireless sensing systems, designers have attempted various combinations of protocol design and manual code optimization. Although th...