Sciweavers

7167 search results - page 569 / 1434
» Answer Set Programming
Sort
View
CCS
2010
ACM
15 years 5 months ago
Input generation via decomposition and re-stitching: finding bugs in Malware
Attackers often take advantage of vulnerabilities in benign software, and the authors of benign software must search their code for bugs in hopes of finding vulnerabilities before...
Juan Caballero, Pongsin Poosankam, Stephen McCaman...
COMPUTER
2006
98views more  COMPUTER 2006»
15 years 5 months ago
Componentization: The Visitor Example
: In software design, laziness is a virtue: it's better to reuse than to redo. Design patterns are a good illustration. Patterns, a major advance in software architecture, pro...
Bertrand Meyer, Karine Arnout
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
15 years 5 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
150
Voted
CORR
2007
Springer
128views Education» more  CORR 2007»
15 years 5 months ago
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
Sujay Sanghavi
TSE
2008
115views more  TSE 2008»
15 years 4 months ago
Do Crosscutting Concerns Cause Defects?
There is a growing consensus that crosscutting concerns harm code quality. An example of a crosscutting concern is a functional requirement whose implementation is distributed acro...
Marc Eaddy, Thomas Zimmermann, Kaitin D. Sherwood,...