Sciweavers

2877 search results - page 50 / 576
» The Complexity of Planarity Testing
Sort
View
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
14 years 3 months ago
Hierarchy Theorems for Property Testing
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
Oded Goldreich, Michael Krivelevich, Ilan Newman, ...
SPATIALCOGNITION
1998
Springer
14 years 1 months ago
Shape Nouns and Shape Concepts: A Geometry for 'Corner'
This paper investigates geometric and ontological aspects of shape concepts underlying the semantics of nouns. Considering the German shape nouns Ecke and Knick (corner and kink) w...
Carola Eschenbach, Christopher Habel, Lars Kulik, ...
ENGL
2008
122views more  ENGL 2008»
13 years 9 months ago
Real-Time Population Based Optimization for Adaptive Motion Control of Robot Manipulator
A population based real-time optimization method for tuning dynamic position control parameters of robot manipulators has been proposed. Conventionally, the positional control is a...
Mehmet Bodur
TVLSI
2008
89views more  TVLSI 2008»
13 years 9 months ago
Test Set Development for Cache Memory in Modern Microprocessors
Up to 53% of the time spent on testing current Intel microprocessors is needed to test on-chip caches, due to the high complexity of memory tests and to the large amount of transis...
Zaid Al-Ars, Said Hamdioui, Georgi Gaydadjiev, Sta...
ICTAI
2005
IEEE
14 years 2 months ago
Using a Lagrangian Heuristic for a Combinatorial Auction Problem
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Jiqing T...