Sciweavers

1302 search results - page 116 / 261
» On the Strong Chromatic Number
Sort
View
IJFCS
2006
70views more  IJFCS 2006»
15 years 6 months ago
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
CORR
2007
Springer
141views Education» more  CORR 2007»
15 years 6 months ago
Managing Uncertainty: A Case for Probabilistic Grid Scheduling
The Grid technology is evolving into a global, service-orientated architecture – a universal platform for delivering future high demand computational services. Strong adoption of...
Aleksandar Lazarevic, Lionel Sacks, Ognjen Prnjat
AAI
2004
136views more  AAI 2004»
15 years 6 months ago
Between Location Awareness and Aware Locations: Where to Put The Intelligence
Location awareness is a key ingredient to many applications of mobile devices. Devices with the ability to determine their own position in space can retrieve, filter or present in...
Andreas Butz
ETAI
2000
84views more  ETAI 2000»
15 years 6 months ago
Learning Stochastic Logic Programs
Stochastic logic programs combine ideas from probabilistic grammars with the expressive power of definite clause logic; as such they can be considered as an extension of probabili...
Stephen Muggleton
GPEM
2000
103views more  GPEM 2000»
15 years 6 months ago
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Abstract. Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program s...
William B. Langdon