4372 search results - page 102 / 875 » Algorithmic Theories of Everything |
105
Voted
EUSFLAT
2001
15 years 2 months ago
2001
One of the biggest problems in computer vision systems, analyzing images having high uncertainty/vagueness degree, is the treatment of such uncertainty. This problem is even clear...
110
Voted
AAAI
1997
15 years 2 months ago
1997
CNF-BCP is a well-known propositional reasoner that extends clausal Boolean Constraint Propagation (BCP) to non-clausal theories. Although BCP has efficient linear-time implementa...
102
Voted
EOR
2008
15 years 1 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
112
Voted
SAGT
2010
Springer
14 years 11 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
125
Voted
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...