Sciweavers

5995 search results - page 343 / 1199
» Algorithmic Game Theory
Sort
View
AAAI
1997
15 years 8 months ago
Model-Theoretic Semantics and Tractable Algorithm for CNF-BCP
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...
Rahul Roy-Chowdhury, Mukesh Dalal
EOR
2008
136views more  EOR 2008»
15 years 6 months ago
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
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...
Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...
ATAL
2008
Springer
15 years 8 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
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...
Emma Bowring, Jonathan P. Pearce, Christopher Port...
INFOCOM
1997
IEEE
15 years 11 months ago
A Linear Control Approach to Explicit Rate Feedback in ATM Networks
Rate-based feedback congestion control has been proposed as a form of traffic management for available bit rate traffic in ATM networks. This paper discusses applying linear con...
Charles E. Rohrs, Randall A. Berry
160
Voted
MSCS
2008
87views more  MSCS 2008»
15 years 6 months ago
Coercions in a polymorphic type system
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The tra...
Zhaohui Luo