Sciweavers

830 search results - page 121 / 166
» Generalizing Global Constraints Based on Network Flows
Sort
View
SIGECOM
2006
ACM
138views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Bid expressiveness and clearing algorithms in multiattribute double auctions
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
Yagil Engel, Michael P. Wellman, Kevin M. Lochner
ICRA
2002
IEEE
167views Robotics» more  ICRA 2002»
14 years 1 months ago
Coordinated Teams of Reactive Mobile Platforms
This paper presents techniques for exploiting redundancy in teams of mobile robots. In particular, we address tasks involving the kinematic coordination of several communicating r...
John Sweeney, T. J. Brunette, Yunlei Yang, Roderic...
LISA
2003
13 years 10 months ago
Using Service Grammar to Diagnose BGP Configuration Errors
Often network components work correctly, yet end-to-end services don’t. This happens if configuration parameters of components are set to incorrect values. Configuration is a fu...
Xiaohu Qie, Sanjai Narain
CASES
2004
ACM
14 years 2 months ago
High-level power analysis for on-chip networks
As on-chip networks become prevalent in multiprocessor systemson-a-chip and multi-core processors, they will be an integral part of the design flow of such systems. With power in...
Noel Eisley, Li-Shiuan Peh
CVPR
1997
IEEE
14 years 10 months ago
Disparity Component Matching for Visual Correspondence
We present a method for computing dense visual correspondence based on general assumptions about scene geometry. Our algorithm does not rely on correlation, and uses a variable re...
Yuri Boykov, Olga Veksler, Ramin Zabih