1431 search results - page 119 / 287 » The complexity of random ordered structures |
142
click to vote
AGENTS
2001
Springer
15 years 7 months ago
2001
Springer
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
136
click to vote
CSL
2009
Springer
15 years 7 months ago
2009
Springer
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
147
click to vote
COCO
2011
Springer
14 years 2 months ago
2011
Springer
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
122
click to vote
CN
2008
15 years 3 months ago
2008
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
120
click to vote
GPEM
2007
15 years 3 months ago
2007
Studying an evolving complex system and drawing some conclusions from it is an integral part of nature-inspired computing; being a part of that complex system, some insight can als...