Sciweavers

8196 search results - page 1470 / 1640
» Computational Modeling and Complexity Science
Sort
View
137
Voted
AAMAS
2008
Springer
15 years 4 months ago
Logic-based automated multi-issue bilateral negotiation in peer-to-peer e-marketplaces
Abstract. We present a novel logic-based framework to automate multi-issue bilateral negotiation in e-commerce settings. The approach exploits logic as communication language among...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
CGF
2008
227views more  CGF 2008»
15 years 3 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...
CONCURRENCY
2008
102views more  CONCURRENCY 2008»
15 years 3 months ago
Dynamic data replication in LCG 2008
To provide performant access to data from high energy physics experiments such as the Large Hadron Collider (LHC), controlled replication of files among grid sites is required. Dy...
Caitriana Nicholson, David G. Cameron, A. T. Doyle...
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 3 months ago
Polynomial Linear Programming with Gaussian Belief Propagation
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev
121
Voted
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 3 months ago
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash
« Prev « First page 1470 / 1640 Last » Next »