Sciweavers

1405 search results - page 44 / 281
» Popularity at Minimum Cost
Sort
View
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
15 years 3 months ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan
82
Voted
WINE
2005
Springer
109views Economy» more  WINE 2005»
15 years 3 months ago
Subjective-Cost Policy Routing
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
Joan Feigenbaum, David R. Karger, Vahab S. Mirrokn...
66
Voted
ICMCS
2005
IEEE
143views Multimedia» more  ICMCS 2005»
15 years 3 months ago
Rate-distortion estimation for H.264/AVC coders
In a video coder, the optimal coding mode decision for each coding block could be achieved by exhaustively calculating the Lagrange cost (which includes the coding distortion plus...
Yu-Kuang Tu, Jar-Ferr Yang, Ming-Ting Sun
84
Voted
CP
2007
Springer
15 years 3 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
98
Voted
ICDCSW
2005
IEEE
15 years 3 months ago
QoS Oriented Dynamic Replica Cost Model for P2P Computing
Replication on multiple nodes is an effective way to improve the availability in the P2P or grid environment. It is difficult to determine how many replicas can fulfill the user r...
Feng Mao, Hai Jin, Deqing Zou, Baoli Chen, Li Qi