Sciweavers

5964 search results - page 839 / 1193
» A theory of speculative computation
Sort
View
ACMICEC
2006
ACM
111views ECommerce» more  ACMICEC 2006»
15 years 10 months ago
Passive verification of the strategyproofness of mechanisms in open environments
Consider an open infrastructure in which anyone can deploy mechanisms to support automated decision making and coordination amongst self-interested computational agents. Strategyp...
Laura Kang, David C. Parkes
AMAST
2006
Springer
15 years 10 months ago
Some Programming Languages for Logspace and Ptime
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
Guillaume Bonfante
CCS
2006
ACM
15 years 10 months ago
Can machine learning be secure?
Machine learning systems offer unparalled flexibility in dealing with evolving input in a variety of applications, such as intrusion detection systems and spam e-mail filtering. H...
Marco Barreno, Blaine Nelson, Russell Sears, Antho...
ENC
2004
IEEE
15 years 10 months ago
Distributed Learning in Intentional BDI Multi-Agent Systems
Despite the relevance of the belief-desire-intention (BDI) model of rational agency, little work has been done to deal with its two main limitations: the lack of learning competen...
Alejandro Guerra-Hernández, Amal El Fallah-...
FOCS
2004
IEEE
15 years 10 months ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau