Sciweavers

622 search results - page 115 / 125
» Answer Set Programming and Bounded Model Checking
Sort
View
SIAMDM
2002
124views more  SIAMDM 2002»
13 years 7 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella
EUROSYS
2006
ACM
14 years 5 months ago
Thorough static analysis of device drivers
Bugs in kernel-level device drivers cause 85% of the system crashes in the Windows XP operating system [44]. One of the sources of these errors is the complexity of the Windows dr...
Thomas Ball, Ella Bounimova, Byron Cook, Vladimir ...
EDBT
2009
ACM
138views Database» more  EDBT 2009»
14 years 2 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
PLDI
2009
ACM
14 years 2 months ago
TAJ: effective taint analysis of web applications
Taint analysis, a form of information-flow analysis, establishes whether values from untrusted methods and parameters may flow into security-sensitive operations. Taint analysis...
Omer Tripp, Marco Pistoia, Stephen J. Fink, Manu S...
HICSS
2002
IEEE
138views Biometrics» more  HICSS 2002»
14 years 27 days ago
Artificial Computer-Assisted International Negotiation: A Tool for Research and Practice
We propose a web-based computer-assisted tool for diagnosing progress in international negotiation. The system is based on a general linear model. Innovative features of the progr...
Daniel Druckman, Richard Harris, Bennett Ramberg