Sciweavers

99 search results - page 17 / 20
» Job-agents: How to coordinate them
Sort
View
EOR
2006
40views more  EOR 2006»
13 years 7 months ago
A common notion of clockwise can help in planar rendezvous
Two players are lost in a grid of city streets and wish to meet as soon as possible. Knowing only the distribution of the other's initial location (two nodes away in one of t...
Steve Alpern, Vic Baston
TCS
2008
13 years 7 months ago
Scheduling to maximize participation
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...
Ioannis Caragiannis, Christos Kaklamanis, Panagiot...
WWW
2008
ACM
14 years 8 months ago
Sewnet -: a framework for creating services utilizing telecom functionality
With Telecom market reaching saturation in many geographies and revenues from voice calls decreasing, Telecom operators are trying to identify new sources of revenue. For this pur...
Sumit Mittal, Dipanjan Chakraborty, Sunil Goyal, S...
ATAL
2007
Springer
14 years 1 months ago
Bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combina...
Benito Mendoza García, José M. Vidal
TOG
2008
236views more  TOG 2008»
13 years 7 months ago
Face swapping: automatically replacing faces in photographs
In this paper, we present a complete system for automatic face replacement in images. Our system uses a large library of face images created automatically by downloading images fr...
Dmitri Bitouk, Neeraj Kumar, Samreen Dhillon, Pete...