28 search results - page 4 / 6 » ci 2006 |
IANDC
2000
13 years 7 months ago
2000
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is to de ne its closed-instance extension, Rci, which holds for a given pair of ope...
MST
2010
13 years 5 months ago
2010
Partial words are finite sequences over a finite alphabet A that may contain a number of “do not know” symbols denoted by ’s. Setting A = A ∪ { }, A∗ denotes the set o...
CI
2011
13 years 2 months ago
2011
This paper is focused on how a general-purpose hierarchical planning representation, based on the HTN paradigm, can be used to support the representation of oncology treatment pro...
FCCM
2006
IEEE
14 years 1 months ago
2006
IEEE
The growth in size and performance of Field Programmable Gate Arrays (FPGAs) has compelled System-on-aProgrammable-Chip (SoPC) designers to use soft processors for controlling sys...
JGT
2006
13 years 7 months ago
2006
An edge-colored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. Bang-Jensen and G. Gutin conjectured that an edgecolored complete graph ...