2272 search results - page 43 / 455 » Capture Complexity by Partition |
DIAGRAMS
2006
Springer
15 years 1 months ago
2006
Springer
Illustrating a dynamic process with an arrow-containing diagram is a widespread convention in people's daily communications. In order to build a basis for capturing the struct...
CSL
2009
Springer
15 years 1 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...
AGENTS
1999
Springer
15 years 2 months ago
1999
Springer
In this paper, we present a novel multi-agent learning paradigm called team-partitioned, opaque-transition reinforcement learning (TPOT-RL). TPOT-RL introduces the concept of usin...
DMTCS
2003
14 years 11 months ago
2003
Two philosophical applications of the concept of program-size complexity are discussed. First, we consider the light program-size complexity sheds on whether mathematics is invent...
ICCAD
1996
IEEE
15 years 1 months ago
1996
IEEE
We presenta new representationfor Boolean functions called PartitionedROBDDs. In this representation we divide the Boolean space into `k' partitions and represent a function ...