121 search results - page 18 / 25 » Modular Decomposition of Hypergraphs |
ENTCS
2007
13 years 7 months ago
2007
Automated deduction methods should be speciļ¬ed not procedurally, but declaratively, as inference systems which are proved correct regardless of implementation details. Then, diļ...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
Evolutionary multi-objective optimization (EMO) methodologies, suggested in the beginning of Nineties, focussed on the task of ļ¬nding a set of well-converged and well-distribute...
TCC
2012
Springer
12 years 3 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving diļ¬erential privacy, and give new algorithms (and new analyses of exis...
CSCWD
2009
Springer
14 years 2 months ago
2009
Springer
This work presents a methodology to formally model and to build collaborative three dimensional interaction tasks in virtual environments using three different tools: Petri Nets, ...
ISSAC
2009
Springer
14 years 1 months ago
2009
Springer
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...