Sciweavers

257 search results - page 25 / 52
» ais 2006
Sort
View
JSYML
2010
114views more  JSYML 2010»
14 years 8 months ago
The Ackermann functions are not optimal, but by how much?
By taking a closer look at the construction of an Ackermann function we see that between any primitive recursive degree and its Ackermann modification there is a dense chain of p...
Harold Simmons
IJIS
2007
88views more  IJIS 2007»
14 years 9 months ago
Recent advances in computational models of natural argument
This paper reviews recent advances in the interdisciplinary area lying between artificial intelligence and the theory of argumentation. The paper has two distinct foci: first, exam...
Chris Reed, Floriana Grasso
COMBINATORICS
2000
107views more  COMBINATORICS 2000»
14 years 9 months ago
Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs
A (multi)hypergraph H with vertices in N contains a permutation p = a1a2 . . . ak of 1, 2, . . . , k if one can reduce H by omitting vertices from the edges so that the resulting ...
Martin Klazar
IV
2006
IEEE
113views Visualization» more  IV 2006»
15 years 3 months ago
Output Media Adapted Cartographic Visualisation
In modern cartography of the late twentieth century, the Internet offers an ideal platform for the communication via maps. The map graphics pose as an essential part of the graphi...
Alexandra Stadler, Mirjanka Lechthaler
SKG
2006
IEEE
15 years 3 months ago
Service Search Strategy Based on Graph in Grid Environment
Service discovery is a key concept in a distributed Grid environment. The first step towards Grid implement is the discovery of services. In this paper, we build a new Grid servic...
Zilin Song, Weihua Ai, Yi Wang, Liang Wu