Sciweavers

1425 search results - page 207 / 285
» Beyond Dependency Graphs
Sort
View
DCC
2011
IEEE
13 years 3 months ago
Sparse Boolean equations and circuit lattices
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
Igor Semaev
SCP
2010
123views more  SCP 2010»
13 years 2 months ago
Slicing for architectural analysis
Current software development often relies on non trivial coordination logic for combining autonomous services, eventually running on different platforms. As a rule, however, such ...
Nuno F. Rodrigues, Luís Soares Barbosa
SIAMJO
2010
110views more  SIAMJO 2010»
13 years 2 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng
ICASSP
2011
IEEE
12 years 12 months ago
Factor graph-based structural equilibria in dynamical games
Correlated equilibria are a generalization of Nash equilibria that permit agents to act in a correlated manner and can therefore, model learning in games. In this paper we define...
Liming Wang, Vikram Krishnamurthy, Dan Schonfeld
SIGSOFT
2008
ACM
14 years 8 months ago
Effective blame for information-flow violations
Programs trusted with secure information should not release that information in ways contrary to system policy. However, when a program contains an illegal flow of information, cu...
Dave King 0002, Trent Jaeger, Somesh Jha, Sanjit A...