1712 search results - page 175 / 343 » A Computational Approach to Binding Theory |
BERTINORO
2005
Springer
15 years 7 months ago
2005
Springer
The possibility of building self-aware software fascinated computer scientist since the beginning of computer science. Research in AI, and in particular on software agents, agent s...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
The Negative Slope Coefficient (nsc) is an empirical measure of problem hardness based on the analysis of offspring-fitness vs. parent-fitness scatterplots. The nsc has been teste...
103
click to vote
EMSOFT
2006
Springer
15 years 5 months ago
2006
Springer
Recently, a number of frameworks were proposed to extend interface theory to the domains of single-processor and distributed real-time systems. This paper unifies some of these ap...
115
Voted
STACS
2010
Springer
15 years 8 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
118
click to vote
SIGLEX
1991
15 years 5 months ago
1991
The lexical entry for a word must contain all the information needed to construct a semantic representation for sentences that contain the word. Because of that requirement, the f...