122 search results - page 9 / 25 » Light types for polynomial time computation in lambda-calcul... |
133
Voted
ATMOS
2007
15 years 5 months ago
2007
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
101
Voted
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
A self-stabilizing protocol is a brilliant framework for fault tolerance. It can recover from any number and any type of transient faults and eventually converge to its intended b...
154
Voted
CSC
2009
15 years 4 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
117
Voted
ACTA
2006
15 years 3 months ago
2006
The P systems (or membrane systems) are a class of distributed parallel computing devices of a biochemical type, where membrane division is the frequently investigated way for obta...
148
Voted
TARK
2009
Springer
15 years 10 months ago
2009
Springer
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...