225 search results - page 7 / 45 » Explicit Combinatorial Structures for Cooperative Distribute... |
SIGECOM
2005
ACM
14 years 2 months ago
2005
ACM
We present the first design for a fully expressive iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language that is concise and expressive ...
EMMCVPR
2001
Springer
14 years 1 months ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
AI
2000
Springer
13 years 9 months ago
2000
Springer
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
Abstract—BitTorrent has been the most popular P2P (Peer-toPeer) paradigm during recent years. Built upon great intuition, the piece-selection and neighbor-selection modules roote...
CONSTRAINTS
2008
13 years 9 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...