Sciweavers

2877 search results - page 140 / 576
» The Complexity of Planarity Testing
Sort
View
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
15 years 6 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn
PROCEDIA
2010
119views more  PROCEDIA 2010»
15 years 2 months ago
Performance and accuracy of Lattice-Boltzmann kernels on multi- and manycore architectures
We present different kernels based on Lattice-Boltzmann methods for the solution of the twodimensional Shallow Water and Navier-Stokes equations on fully structured lattices. The...
Dirk Ribbrock, Markus Geveler, Dominik Göddek...
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
15 years 11 months ago
Fast Algorithm for Graph Isomorphism Testing
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
José Luis López-Presa, Antonio Fern&...
VTS
2008
IEEE
136views Hardware» more  VTS 2008»
15 years 10 months ago
Test-Pattern Grading and Pattern Selection for Small-Delay Defects
Timing-related defects are becoming increasingly important in nanometer technology designs. Small delay variations induced by crosstalk, process variations, powersupply noise, as ...
Mahmut Yilmaz, Krishnendu Chakrabarty, Mohammad Te...
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 8 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic