Sciweavers

8695 search results - page 412 / 1739
» Making the Complex Simple
Sort
View
CSUR
2000
69views more  CSUR 2000»
15 years 7 months ago
The framework approach for constraint satisfaction
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
Pierre Roy, Anne Liret, François Pachet
LOBJET
2002
321views more  LOBJET 2002»
15 years 7 months ago
Understanding software evolution using a combination of software visualization and software metrics
Coping with huge amounts of data is one of the major problems in the context of software evolution. Current approaches reduce this complexity by filtering out irrelevant informatio...
Michele Lanza, Stéphane Ducasse
TVLSI
2008
117views more  TVLSI 2008»
15 years 7 months ago
Configurable VLSI Architecture for Deblocking Filter in H.264/AVC
In this paper, we study and analyze the computational complexity of the deblocking filter in H.264/AVC baseline decoder based on SimpleScalar/ARM simulator. The simulation result s...
Chung-Ming Chen, Chung-Ho Chen
ICRA
2010
IEEE
107views Robotics» more  ICRA 2010»
15 years 6 months ago
Fast resolution of hierarchized inverse kinematics with inequality constraints
— Classically, the inverse kinematics is performed by computing the singular value decomposition of the matrix to invert. This enables a very simple writing of the algorithm. How...
Adrien Escande, Nicolas Mansard, Pierre-Brice Wieb...
TCBB
2010
114views more  TCBB 2010»
15 years 6 months ago
Cache-Oblivious Dynamic Programming for Bioinformatics
— We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alig...
Rezaul Alam Chowdhury, Hai-son Le, Vijaya Ramachan...