Sciweavers

2286 search results - page 412 / 458
» Algorithms for Categorical Equivalence
Sort
View
INFOCOM
2009
IEEE
15 years 4 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar
ATAL
2009
Springer
15 years 4 months ago
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human intera...
James Pita, Manish Jain, Fernando Ordó&ntil...
FOCS
2006
IEEE
15 years 3 months ago
On the Compressibility of NP Instances and Cryptographic Applications
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
Danny Harnik, Moni Naor
PPOPP
2005
ACM
15 years 3 months ago
Automated type-based analysis of data races and atomicity
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose at run-time. This motivated the development of type systems that statically en...
Amit Sasturkar, Rahul Agarwal, Liqiang Wang, Scott...
CP
2005
Springer
15 years 3 months ago
2-Way vs. d-Way Branching for CSP
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
Joey Hwang, David G. Mitchell