Sciweavers

7930 search results - page 1455 / 1586
» Greedy in Approximation Algorithms
Sort
View
AI
2005
Springer
15 years 3 months ago
Adopt: asynchronous distributed constraint optimization with quality guarantees
The Distributed Constraint Optimization Problem (DCOP) is able to model a wide variety of distributed reasoning tasks that arise in multiagent systems. Unfortunately, existing met...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...
SMA
2008
ACM
154views Solid Modeling» more  SMA 2008»
15 years 3 months ago
Consistent computation of first- and second-order differential quantities for surface meshes
Differential quantities, including normals, curvatures, principal directions, and associated matrices, play a fundamental role in geometric processing and physics-based modeling. ...
Xiangmin Jiao, Hongyuan Zha
TCOM
2008
98views more  TCOM 2008»
15 years 3 months ago
Performance evaluation of multi-hop CSMA/CA networks in fading environments
The performance of multi-hop CSMA/CA networks has in most cases been evaluated via simulations, or analytically using a perfect collision channel model. Using such methods, one ca...
Duong A. Hoang, Ronald A. Iltis
TCS
2008
15 years 3 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...
IPL
2007
76views more  IPL 2007»
15 years 3 months ago
Minimum cost subpartitions in graphs
Given an edge-weighted graph G = (V,E), a subset S ⊆ V , an integer k 1 and a real b 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X1...
Hiroshi Nagamochi, Yoko Kamidoi
« Prev « First page 1455 / 1586 Last » Next »