Sciweavers

1727 search results - page 57 / 346
» A Technique for Large Automated Mechanism Design Problems
Sort
View
HICSS
2006
IEEE
133views Biometrics» more  HICSS 2006»
16 years 7 days ago
Being Literate with Large Document Collections: Observational Studies and Cost Structure Tradeoffs
How do people work with large document collections? We studied the effects of different kinds of analysis tools on the behavior of people doing rapid large-volume data assessment,...
Daniel M. Russell, Malcolm Slaney, Yan Qu, Mave Ho...
SP
1998
IEEE
173views Security Privacy» more  SP 1998»
15 years 10 months ago
An Automated Approach for Identifying Potential Vulnerabilities in Software
This paper presents results from analyzing the vulnerability of security-critical software applications to malicious threats and anomalous events using an automated fault injectio...
Anup K. Ghosh, Tom O'Connor, Gary McGraw
IPCO
2008
221views Optimization» more  IPCO 2008»
15 years 7 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
EMSOFT
2006
Springer
15 years 10 months ago
Software partitioning for effective automated unit testing
A key problem for effective unit testing is the difficulty of partitioning large software systems into appropriate units that can be tested in isolation. We present an approach th...
Arindam Chakrabarti, Patrice Godefroid
IPPS
2008
IEEE
16 years 18 days ago
A game theoretical data replication technique for mobile ad hoc networks
Adaptive replication of data items on servers of a mobile ad hoc network can alleviate access delays. The selection of data items and servers requires solving a constrained optimi...
Samee Ullah Khan, Anthony A. Maciejewski, Howard J...