Sciweavers

147 search results - page 25 / 30
» The Uncapacitated Swapping Problem
Sort
View
AAAI
2007
14 years 5 days ago
Allocating Goods on a Graph to Eliminate Envy
We introduce a distributed negotiation framework for multiagent resource allocation where interactions between agents are limited by a graph defining a negotiation topology. A gr...
Yann Chevaleyre, Ulrich Endriss, Nicolas Maudet
JDA
2011
90views more  JDA 2011»
13 years 4 months ago
Pattern matching in pseudo real-time
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...
Raphaël Clifford, Benjamin Sach
APSEC
2008
IEEE
14 years 4 months ago
Towards Unanticipated Runtime Adaptation of Java Applications
Modifying an application usually means to stop the application, apply the changes, and start the application again. That means, the application is not available for at least a sho...
Mario Pukall, Christian Kästner, Gunter Saake
CRV
2007
IEEE
231views Robotics» more  CRV 2007»
14 years 4 months ago
Establishing Visual Correspondence from Multi-Resolution Graph Cuts for Stereo-Motion
This paper presents the design and implementation of a multi-resolution graph cuts (MRGC) for stereo-motion framework that produces dense disparity maps. Both stereo and motion ar...
Joshua Worby, W. James MacLean
APPT
2007
Springer
14 years 4 months ago
An Efficient Construction of Node Disjoint Paths in OTIS Networks
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
Weidong Chen, Wenjun Xiao, Behrooz Parhami