Sciweavers

1568 search results - page 45 / 314
» The problem of examination questions in algorithmics
Sort
View
AAAI
2006
14 years 11 months ago
Analysis of Privacy Loss in Distributed Constraint Optimization
Distributed Constraint Optimization (DCOP) is rapidly emerging as a prominent technique for multiagent coordination. However, despite agent privacy being a key motivation for appl...
Rachel Greenstadt, Jonathan P. Pearce, Milind Tamb...
SFP
2000
14 years 11 months ago
Detecting common elements of types
: We describe an algorithm approximatingthe following question: Given two types t1 and t2, are there instances (t1) and (t2) denoting a common element? By answering this question w...
Manfred Widera, Christoph Beierle
FOSSACS
2009
Springer
15 years 4 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
ATAL
2005
Springer
15 years 3 months ago
A distributed framework for solving the Multiagent Plan Coordination Problem
We examine whether and how the Multiagent Plan Coordination Problem, the problem of resolving interactions between the plans of multiple agents, can be cast as a Distributed Const...
Jeffrey S. Cox, Edmund H. Durfee, Thomas Bartold
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
15 years 4 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...