Sciweavers

398 search results - page 47 / 80
» Tuning P Systems for Solving the Broadcasting Problem
Sort
View
NIPS
2003
14 years 11 months ago
An MDP-Based Approach to Online Mechanism Design
Online mechanism design (MD) considers the problem of providing incentives to implement desired system-wide outcomes in systems with self-interested agents that arrive and depart ...
David C. Parkes, Satinder P. Singh
ATAL
2011
Springer
13 years 9 months ago
Decomposing constraint systems: equivalences and computational properties
Distributed systems can often be modeled as a collection of distributed (system) variables whose values are constrained by a set of constraints. In distributed multi-agent systems...
Wiebe van der Hoek, Cees Witteveen, Michael Wooldr...
NIPS
1996
14 years 11 months ago
Predicting Lifetimes in Dynamically Allocated Memory
Predictions oflifetimesofdynamicallyallocated objects can be used to improve time and space e ciency of dynamic memory management in computer programs. Barrett and Zorn 1993] used...
David A. Cohn, Satinder P. Singh
COCOON
2000
Springer
15 years 2 months ago
Recent Progress and Prospects for Integer Factorisation Algorithms
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...
Richard P. Brent
CADE
2006
Springer
15 years 10 months ago
Inferring Network Invariants Automatically
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
Olga Grinchtein, Martin Leucker, Nir Piterman