Sciweavers

786 search results - page 46 / 158
» A static theory of promises
Sort
View
AAAI
2006
14 years 11 months ago
Local-Search Techniques for Boolean Combinations of Pseudo-Boolean Constraints
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...
Lengning Liu, Miroslaw Truszczynski
TISSEC
2002
123views more  TISSEC 2002»
14 years 9 months ago
An algebraic approach to IP traceback
We present a new solution to the problem of determining the path a packet traversed over the Internet (called the traceback problem) during a denial of service attack. Previous so...
Drew Dean, Matthew K. Franklin, Adam Stubblefield
SIGMOD
2012
ACM
278views Database» more  SIGMOD 2012»
13 years 11 days ago
Differential privacy in data publication and analysis
Data privacy has been an important research topic in the security, theory and database communities in the last few decades. However, many existing studies have restrictive assumpt...
Yin Yang, Zhenjie Zhang, Gerome Miklau, Marianne W...
DATE
2006
IEEE
149views Hardware» more  DATE 2006»
15 years 4 months ago
Communication architecture optimization: making the shortest path shorter in regular networks-on-chip
Network-on-Chip (NoC)-based communication represents a promising solution to complex on-chip communication problems. Due to their regular structure, mesh-like NoC architectures ha...
Ümit Y. Ogras, Radu Marculescu, Hyung Gyu Lee...
CP
2005
Springer
15 years 3 months ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter