Sciweavers

4218 search results - page 671 / 844
» Complete sets of cooperations
Sort
View
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
13 years 9 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
ENTCS
2008
102views more  ENTCS 2008»
13 years 9 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
ENTCS
2008
120views more  ENTCS 2008»
13 years 9 months ago
Towards a Quantum Calculus: (Work in Progress, Extended Abstract)
Progress, Extended Abstract) Philippe Jorrand1 Simon Perdrix2 Leibniz Laboratory IMAG-INPG Grenoble, France The aim of this paper is to introduce a general model of quantum comput...
Philippe Jorrand, Simon Perdrix
ERCIM
2008
130views more  ERCIM 2008»
13 years 9 months ago
Mediated Collaborative Learning
Information and Communication Technologies facilitate the emergence of new contexts and practices of learning that educational institutions have to adapt to their pedagogical disc...
Kostas Pentikousis, Carmen Martinez-Carrillo
ESWA
2008
124views more  ESWA 2008»
13 years 9 months ago
An expert system for dynamic re-coordination of distributed workflows
A persistent problem in the use of automated workflow management systems for inter-organizational workflows has been the need for manual redefinition of coordination points in the...
William L. Kuechler Jr., Vijay K. Vaishnavi