Sciweavers

4378 search results - page 57 / 876
» On the Complexity of Ordered Colourings
Sort
View
AAAI
1994
13 years 10 months ago
Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
Steven Minton, Ian Underwood
TWC
2008
109views more  TWC 2008»
13 years 8 months ago
Semi-Blind Adaptive Spatial Equalization for MIMO Systems with High-Order QAM Signalling
This contribution investigates semi-blind adaptive spatial filtering or equalisation for multiple-input multiple-output (MIMO) systems that employ high-throughput quadrature amplit...
Sheng Chen, Wang Yao, Lajos Hanzo
CGF
2004
117views more  CGF 2004»
13 years 8 months ago
Space-Time Hierarchical Radiosity with Clustering and Higher-Order Wavelets
We address in this paper the issue of computing diffuse global illumination solutions for animation sequences. The principal difficulties lie in the computational complexity of gl...
Cyrille Damez, Nicolas Holzschuch, François...
JC
2002
50views more  JC 2002»
13 years 8 months ago
Verifying Topological Indices for Higher-Order Rank Deficiencies
It has been known how to use computational fixed point theorems to verify existence and uniqueness of a true solution to a nonlinear system of equations within a small region abou...
R. Baker Kearfott, Jianwei Dian
GECCO
2003
Springer
14 years 2 months ago
Multi-objectivity as a Tool for Constructing Hierarchical Complexity
Abstract. This paper presents a novel perspective to the use of multiobjective optimization and in particular evolutionary multi-objective optimization (EMO) as a measure of comple...
Jason Teo, Minh Ha Nguyen, Hussein A. Abbass