Sciweavers

1839 search results - page 314 / 368
» Models of Coordination
Sort
View
ICML
2010
IEEE
13 years 9 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
PODC
2010
ACM
13 years 8 months ago
The k-bakery: local-spin k-exclusion using non-atomic reads and writes
Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneous...
Robert Danek
AEI
2007
112views more  AEI 2007»
13 years 8 months ago
A p2p based service flow system with advanced ontology-based service profiles
A peer-to-peer (p2p) based service flow management system, SwinDeW-S, could support decentralised Web service composition, deployment and enactment. However, traditional workflow ...
Jun Shen, Yun Yang, Jun Yan
ANOR
2007
151views more  ANOR 2007»
13 years 8 months ago
Distributed personnel scheduling - negotiation among scheduling agents
This paper introduces a model for Distributed Employee Timetabling Problems (DisETPs) and proposes a general architecture for solving DisETPs by using a Multi Agent System (MAS) pa...
Eliezer Kaplansky, Amnon Meisels
CGF
2010
153views more  CGF 2010»
13 years 8 months ago
Localized Delaunay Refinement for Sampling and Meshing
The technique of Delaunay refinement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one la...
Tamal K. Dey, Joshua A. Levine, A. Slatton