Sciweavers

2452 search results - page 140 / 491
» The Case for Precision Sharing
Sort
View
DCC
2008
IEEE
16 years 7 months ago
On the graph of a function in many variables over a finite field
Some improved bounds on the number of directions not determined by a point set in the affine space AG(k, q) are presented. More precisely, if there are more than pe (q -1) directio...
Simeon Ball
ISPW
2009
IEEE
16 years 2 months ago
On the Relative Merits of Software Reuse
Abstract. Using process simulation and AI search methods, we compare software reuse against other possible changes to a project. such as reducing functionality or improving the ski...
Andres S. Orrego, Tim Menzies, Oussama El-Rawas
DATE
2006
IEEE
125views Hardware» more  DATE 2006»
16 years 1 months ago
Combining simulation and formal methods for system-level performance analysis
Recent research on performance analysis for embedded systems shows a trend to formal compositional models and methods. These compositional methods can be used to determine the per...
Simon Künzli, Francesco Poletti, Luca Benini,...
APPROX
2005
Springer
105views Algorithms» more  APPROX 2005»
16 years 1 months ago
The Complexity of Making Unique Choices: Approximating 1-in- k SAT
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
Venkatesan Guruswami, Luca Trevisan
CHARME
2005
Springer
120views Hardware» more  CHARME 2005»
16 years 1 months ago
How Thorough Is Thorough Enough?
Abstraction is the key for effectively dealing with the state explosion in model-checking. Unfortunately, finding abstractions which are small and yet enable us to get conclusive ...
Arie Gurfinkel, Marsha Chechik