Sciweavers

193 search results - page 10 / 39
» Several ways to solve the MSO problem
Sort
View
IAT
2005
IEEE
15 years 3 months ago
An Approximate Pareto Optimal Cooperative Negotiation Model for Multiple
Cooperative negotiation is proved to be an effective paradigm to solve complex dynamic multi-objective problems in which each objective is associated to an agent. When the multi-o...
Nicola Gatti, Francesco Amigoni
67
Voted
GESELLSCHAFT
1993
15 years 1 months ago
Phasenmodell ist OUT - Benutzerbeteiligung jetzt auch bei Standardsoftware-Entwicklung
The current state of traditional software development is surveyed and essential problems are investigated on the basis of system theoretical considerations. The concept of user pa...
Matthias Rauterberg, Raimund Mollenhauer, Philipp ...
FOCS
1991
IEEE
15 years 1 months ago
A parallel algorithmic version of the Local Lemma
The Lov´asz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results with...
Noga Alon
CADE
2010
Springer
14 years 10 months ago
Premise Selection in the Naproche System
Abstract. Automated theorem provers (ATPs) struggle to solve problems with large sets of possibly superfluous axiom. Several algorithms have been developed to reduce the number of ...
Marcos Cramer, Peter Koepke, Daniel Kühlwein,...
ICECCS
2010
IEEE
161views Hardware» more  ICECCS 2010»
14 years 10 months ago
Model Checking Round-Based Distributed Algorithms
—In the field of distributed computing, there are many round-based algorithms to solve fundamental problems, such as leader election and distributed consensus. Due to the nature...
Xin An, Jun Pang