550 search results - page 99 / 110 » Context Semantics, Linear Logic and Computational Complexity |
TAMC
2010
Springer
15 years 2 months ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
101
Voted
KR
2010
Springer
15 years 2 months ago
2010
Springer
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
102
click to vote
ICPADS
2006
IEEE
15 years 3 months ago
2006
IEEE
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
92
Voted
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
104
click to vote
GECCO
2000
Springer
15 years 1 months ago
2000
Springer
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...