165 search results - page 6 / 33 » Constraints: The Ties that Bind |
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importan...
ISCAS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we present two polynomial time-complexity heuristic algorithms for optimization of gate-oxide leakage (tunneling current) during behavioral synthesis through simulta...
ICANN
2003
Springer
14 years 23 days ago
2003
Springer
The number of objects that can be maintained in visual working memory without interference is limited. We present simulations of a model of visual working memory in ventral prefron...
WOLLIC
2010
Springer
14 years 18 days ago
2010
Springer
In type logical categorial grammar the analysis of an expression is a resource-conscious proof. Anaphora represents a particular challenge to this approach in that the antecedent ...
ACL
1990
13 years 8 months ago
1990
This paper presents an implemented, psychologicallyplausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization of the licens...