Sciweavers

242 search results - page 29 / 49
» A SAT-Based Algorithm for Context Matching
Sort
View
TSP
2008
90views more  TSP 2008»
13 years 7 months ago
Array-Based QR-RLS Multichannel Lattice Filtering
An array-based algorithm for multichannel lattice filtering is proposed. The filter is formed by a set of units that are adapted locally and concurrently using recursions that clos...
J. Gomes, V. A. N. Barroso
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
14 years 8 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb
IROS
2007
IEEE
129views Robotics» more  IROS 2007»
14 years 1 months ago
Experience-based and tactile-driven dynamic grasp control
— Algorithms for dextrous robot grasping always have to cope with the challenge of achieving high object specialisation for a wide range of grasping contexts. In this paper, we p...
Jan Steffen, Robert Haschke, Helge Ritter
ECMDAFA
2009
Springer
138views Hardware» more  ECMDAFA 2009»
14 years 2 months ago
A Pattern Mining Approach Using QVT
Model Driven Software Development (MDSD) has matured over the last few years and is now becoming an established technology. Models are used in various contexts, where the possibili...
Jens Kübler, Thomas Goldschmidt
IWPEC
2009
Springer
14 years 2 months ago
Stable Assignment with Couples: Parameterized Complexity and Local Search
We study the Hospitals/Residents with Couples problem, a variant of the classical Stable Marriage problem. This is the extension of the Hospitals/Residents problem where residents ...
Dániel Marx, Ildikó Schlotter