8512 search results - page 201 / 1703 » Computing Theory With Relevance |
130
click to vote
KR
1994
Springer
15 years 9 months ago
1994
Springer
This paper analyzes a language for actions and the deontic modalities over actions -- i.e., the modalities permitted, forbidden and obligatory. The work is based on: (1) an action...
128
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, it is presented a new way to characterize the phenotype in the context of Genetic Algorithms through the use of Game Theory as a theoretical foundation to define a ...
165
click to vote
ICIP
2003
IEEE
16 years 6 months ago
2003
IEEE
In this paper, we describe an algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes. We ...
140
click to vote
SIGCSE
2009
ACM
16 years 5 months ago
2009
ACM
We describe the results from a two-year study with fourteen universities on presenting formal languages in a more visual, interactive and applied manner using JFLAP. In our result...
121
click to vote
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
— A manufacturer producing several items keeps them into safety stocks (buffers) in order to supply an external stochastic demand without interruptions. We consider the classical...