2233 search results - page 214 / 447 » On the Complexity of Theory Curbing |
177
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
151
click to vote
IJCAI
1993
15 years 7 months ago
1993
The problem of representing and reasoning about two notions of time that are relevant in the context of knowledge bases is addressed. These are called historical time and belief t...
157
click to vote
GG
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
177
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
181
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...