Sciweavers

221 search results - page 14 / 45
» Twinkle: programming with color
Sort
View
DAM
2008
88views more  DAM 2008»
14 years 10 months ago
On the asymmetric representatives formulation for the vertex coloring problem
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
Manoel B. Campêlo, Victor A. Campos, Ricardo...
OOPSLA
2009
Springer
15 years 4 months ago
TROPIC: a framework for model transformations on petri nets in color
Model transformation languages, the cornerstone of Modelngineering, often lack mechanisms for abstraction, reuse and debugging. We propose a model transformation k providing diffe...
Manuel Wimmer, Gerti Kappel, Johannes Schönb&...
OPODIS
2008
14 years 11 months ago
Evaluating a Data Removal Strategy for Grid Environments Using Colored Petri Nets
Abstract. In this paper we use colored Petri nets (CPNs) and the supporting CPN Tools for the modeling and performance analysis of grid architectures. The notation of Petri nets is...
Nikola Trcka, Wil M. P. van der Aalst, Carmen Brat...
BMCBI
2006
86views more  BMCBI 2006»
14 years 10 months ago
PHY*FI: fast and easy online creation and manipulation of phylogeny color figures
nd: The need to depict a phylogeny, or some other kind of abstract tree, is very frequently experienced by researchers from a broad range of biological and computational disciplin...
Jakob Fredslund
115
Voted
FOSSACS
2006
Springer
15 years 1 months ago
Register Allocation After Classical SSA Elimination is NP-Complete
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
Fernando Magno Quintão Pereira, Jens Palsbe...