4666 search results - page 708 / 934 » Equations on Timed Languages |
116
click to vote
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
Programmable networks offer the ability to customize router behaviour at run time, thus providing new levels of flexibility for network administrators. We have developed a program...
125
Voted
AIR
2010
15 years 4 months ago
2010
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for...
128
click to vote
COGSCI
2010
15 years 4 months ago
2010
We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same pr...
144
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
135
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...