Sciweavers

5622 search results - page 88 / 1125
» Solving architectural modelling problems using knowledge
Sort
View
122
Voted
COGSCI
2008
90views more  COGSCI 2008»
15 years 2 months ago
Using fMRI to Test Models of Complex Cognition
This article investigates the potential of fMRI to test assumptions about different components in models of complex cognitive tasks. If the components of a model can be associated...
John R. Anderson, Cameron S. Carter, Jon M. Fincha...
113
Voted
IPPS
2003
IEEE
15 years 8 months ago
A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
Carlos E. R. Alves, Edson Cáceres, Siang W....
JAIR
2010
130views more  JAIR 2010»
15 years 1 months ago
A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this...
Bonny Banerjee, B. Chandrasekaran
148
Voted
DAC
2006
ACM
16 years 3 months ago
Optimization of area under a delay constraint in digital filter synthesis using SAT-based integer linear programming
In this paper, we propose an exact algorithm for the problem of area optimization under a delay constraint in the synthesis of multiplierless FIR filters. To the best of our knowl...
Eduardo A. C. da Costa, José Monteiro, Leve...
190
Voted
MFCS
2010
Springer
15 years 1 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...