Sciweavers

699 search results - page 91 / 140
» Generalized Distance Functions in the Theory of Computation
Sort
View
ATAL
2006
Springer
15 years 1 months ago
Tractable negotiation in tree-structured domains
Multiagent resource allocation is a timely and exciting area of research at the interface of Computer Science and Economics. One of the main challenges in this area is the high co...
Yann Chevaleyre, Ulle Endriss, Nicolas Maudet
COMPGEOM
2009
ACM
15 years 4 months ago
Proximity of persistence modules and their diagrams
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
Frédéric Chazal, David Cohen-Steiner...
POPL
2010
ACM
15 years 7 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
15 years 4 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann
PR
2006
88views more  PR 2006»
14 years 9 months ago
Directional features in online handwriting recognition
The selection of valuable features is crucial in pattern recognition. In this paper we deal with the issue that part of features originate from directional instead of common linea...
Claus Bahlmann