Sciweavers

9842 search results - page 51 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
CEC
2005
IEEE
13 years 9 months ago
Equilibrium selection by co-evolution for bargaining problems under incomplete information about time preferences
Abstract- The main purpose of this work is to measure the effect of bargaining players’ information completeness on agreements in evolutionary environments. We apply Co-evolution...
Nanlin Jin
IPL
2006
118views more  IPL 2006»
13 years 7 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
ESANN
2007
13 years 9 months ago
Complexity bounds of radial basis functions and multi-objective learning
In the paper, the problem of multi-objective (MOBJ) learning is discussed. The problem of obtaining apparent (effective) complexity measure, which is one of the objectives, is con...
Illya Kokshenev, Antônio de Pádua Bra...
AML
2007
95views more  AML 2007»
13 years 7 months ago
Complexity of admissible rules
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition unde...
Emil Jerábek
LATIN
1998
Springer
13 years 12 months ago
Shape Reconstruction with Delaunay Complex
The reconstruction of a shape or surface from a finite set of points is a practically significant and theoretically challenging problem. This paper presents a unified view of algor...
Herbert Edelsbrunner